Submission #1367684


Source Code Expand

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.Closeable;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Deque;
import java.util.HashMap;
import java.util.List;

public class Main {
	static ContestScanner in;
	static Writer out;
	public static void main(String[] args) {
		Main main = new Main();
		try {
			in = new ContestScanner();
			out = new Writer();
			main.solve();
			out.close();
			in.close();
		} catch (IOException e) {
			e.printStackTrace();
		}
	}
	
	void solve() throws IOException {
		int n = in.nextInt();
		int m = in.nextInt();
		List<Integer>[] node = new List[n];
		for(int i = 0; i < n; i++) node[i] = new ArrayList<>();
		for(int i = 0; i < m; i++) {
			int a = in.nextInt() - 1;
			int b = in.nextInt() - 1;
			node[a].add(b);
			node[b].add(a);
		}
		boolean[] used = new boolean[n];
		Deque<Integer> qu = new ArrayDeque<>();
		boolean hasNext = true;
		int top = 0;
		qu.addFirst(top);
		used[top] = true;
		while(hasNext) {
			hasNext = false;
			for(int nv: node[top]) {
				if(used[nv]) continue;
				used[nv] = true;
				hasNext = true;
				top = nv;
				qu.addFirst(top);
				break;
			}
		}
		top = 0;
		hasNext = true;
		while(hasNext) {
			hasNext = false;
			for(int nv: node[top]) {
				if(used[nv]) continue;
				used[nv] = true;
				hasNext = true;
				top = nv;
				qu.addLast(top);
				break;
			}
		}
		out.println(qu.size());
		while(!qu.isEmpty()) {
			int v = qu.poll();
			out.print(v + 1);
			if(!qu.isEmpty()) out.print(" ");
		}
		out.println();
	}
}

@SuppressWarnings("serial")
class MultiSet<T> extends HashMap<T, Integer>{
	@Override public Integer get(Object key){return containsKey(key)?super.get(key):0;}
	public void add(T key,int v){put(key,get(key)+v);}
	public void add(T key){put(key,get(key)+1);}
	public void sub(T key){final int v=get(key);if(v==1)remove(key);else put(key,v-1);}
	public MultiSet<T> merge(MultiSet<T> set)
	{MultiSet<T>s,l;if(this.size()<set.size()){s=this;l=set;}else{s=set;l=this;}
	for(Entry<T,Integer>e:s.entrySet())l.add(e.getKey(),e.getValue());return l;}
}

class Writer extends PrintWriter{
	public Writer(String filename)throws IOException
	{super(new BufferedWriter(new FileWriter(filename)));}
	public Writer()throws IOException{super(System.out);}
}
class ContestScanner implements Closeable{
	private BufferedReader in;private int c=-2;
	public ContestScanner()throws IOException 
	{in=new BufferedReader(new InputStreamReader(System.in));}
	public ContestScanner(String filename)throws IOException
	{in=new BufferedReader(new InputStreamReader(new FileInputStream(filename)));}
	public String nextToken()throws IOException {
		StringBuilder sb=new StringBuilder();
		while((c=in.read())!=-1&&Character.isWhitespace(c));
		while(c!=-1&&!Character.isWhitespace(c)){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public String readLine()throws IOException{
		StringBuilder sb=new StringBuilder();if(c==-2)c=in.read();
		while(c!=-1&&c!='\n'&&c!='\r'){sb.append((char)c);c=in.read();}
		return sb.toString();
	}
	public long nextLong()throws IOException,NumberFormatException
	{return Long.parseLong(nextToken());}
	public int nextInt()throws NumberFormatException,IOException
	{return(int)nextLong();}
	public double nextDouble()throws NumberFormatException,IOException 
	{return Double.parseDouble(nextToken());}
	public void close() throws IOException {in.close();}
}

Submission Info

Submission Time
Task B - Hamiltonish Path
User threepipes_s
Language Java8 (OpenJDK 1.8.0)
Score 500
Code Size 3704 Byte
Status AC
Exec Time 346 ms
Memory 57124 KB

Compile Error

Note: ./Main.java uses unchecked or unsafe operations.
Note: Recompile with -Xlint:unchecked for details.

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 500 / 500
Status
AC × 3
AC × 19
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt
Case Name Status Exec Time Memory
sample_01.txt AC 71 ms 20052 KB
sample_02.txt AC 71 ms 20052 KB
sample_03.txt AC 71 ms 18260 KB
subtask_1_01.txt AC 238 ms 50664 KB
subtask_1_02.txt AC 152 ms 32788 KB
subtask_1_03.txt AC 229 ms 44480 KB
subtask_1_04.txt AC 237 ms 50528 KB
subtask_1_05.txt AC 238 ms 50764 KB
subtask_1_06.txt AC 257 ms 52832 KB
subtask_1_07.txt AC 258 ms 54224 KB
subtask_1_08.txt AC 254 ms 49404 KB
subtask_1_09.txt AC 346 ms 57124 KB
subtask_1_10.txt AC 162 ms 38512 KB
subtask_1_11.txt AC 183 ms 45264 KB
subtask_1_12.txt AC 70 ms 19540 KB
subtask_1_13.txt AC 71 ms 20436 KB