結果

問題 No.277 根掘り葉掘り
ユーザー tanzakutanzaku
提出日時 2015-09-04 22:43:26
言語 Java21
(openjdk 21)
結果
AC  
実行時間 274 ms / 3,000 ms
コード長 6,659 bytes
コンパイル時間 3,954 ms
コンパイル使用メモリ 88,980 KB
実行使用メモリ 51,272 KB
最終ジャッジ日時 2024-07-19 01:25:25
合計ジャッジ時間 8,416 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 54 ms
37,856 KB
testcase_01 AC 55 ms
37,476 KB
testcase_02 AC 54 ms
37,624 KB
testcase_03 AC 56 ms
37,824 KB
testcase_04 AC 57 ms
37,352 KB
testcase_05 AC 56 ms
37,476 KB
testcase_06 AC 55 ms
37,728 KB
testcase_07 AC 57 ms
37,644 KB
testcase_08 AC 55 ms
37,744 KB
testcase_09 AC 274 ms
51,000 KB
testcase_10 AC 228 ms
50,756 KB
testcase_11 AC 248 ms
49,720 KB
testcase_12 AC 241 ms
49,624 KB
testcase_13 AC 258 ms
50,392 KB
testcase_14 AC 238 ms
49,744 KB
testcase_15 AC 252 ms
50,912 KB
testcase_16 AC 260 ms
51,272 KB
testcase_17 AC 239 ms
48,520 KB
testcase_18 AC 251 ms
50,856 KB
testcase_19 AC 259 ms
50,812 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class MainStack implements Runnable {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	@Override
	public void run() {
		try {
			runMain();
		}
		catch(Exception e) {
			
		}
	}

	public void runMain() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int n = io.nextInt();
			SimpleAdjListGraph g = new SimpleAdjListGraph(n, 2*n);
			int[] deg = new int[n];
			for(int i = 0; i < n - 1; i++) {
				int x = io.nextInt() - 1;
				int y = io.nextInt() - 1;
				g.addEdge(x, y);
				g.addEdge(y, x);
				deg[x]++;
				deg[y]++;
			}
			int[] q = new int[2*n];
			boolean[] vis = new boolean[n];
			int s = 0, t = 0;
			for(int i = 0; i < n; i++) {
				if(deg[i] == 1 || i == 0) {
					q[t++] = i;
					vis[i] = true;
				}
			}

			int[] ans = new int[n];
			while(s != t) {
				int v = q[s++];

				for(int e = g.head[v]; e != -1; e = g.next[e]) {
					if(!vis[g.to[e]]) {
						vis[g.to[e]] = true;
						q[t++] = g.to[e];
						ans[g.to[e]] = ans[v] + 1;
					}
				}

			}
			for(int v : ans) io.out.println(v);
		}
		io.out.flush();
	}
	
	static
	class SimpleAdjListGraph {
		int m, V, E;
		int[] head, next, to;

		public SimpleAdjListGraph(int V, int E) {
			head = new int[V];
			next = new int[E];
			to = new int[E];
			this.V = V;
			this.E = E;
			clear();
		}

		public void clear() {
			m = 0;
			Arrays.fill(head, -1);
		}

		public void addEdge(int s, int t) {
			next[m] = head[s];
			head[s] = m;
			to[m++] = t;
		}
	}


	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
      Thread thread = new Thread(null, this, "0", 1<<25);
      thread.start();
      try {
		thread.join();
	} catch (InterruptedException e1) {
		// TODO Auto-generated catch block
		e1.printStackTrace();
	}
//		try { run(); }
//		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new MainStack().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0