結果

問題 No.277 根掘り葉掘り
ユーザー ぴろずぴろず
提出日時 2015-09-04 22:35:57
言語 Java21
(openjdk 21)
結果
AC  
実行時間 446 ms / 3,000 ms
コード長 4,616 bytes
コンパイル時間 3,314 ms
コンパイル使用メモリ 77,884 KB
実行使用メモリ 73,304 KB
最終ジャッジ日時 2023-09-26 05:38:38
合計ジャッジ時間 10,355 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
49,188 KB
testcase_01 AC 42 ms
49,584 KB
testcase_02 AC 47 ms
49,180 KB
testcase_03 AC 47 ms
49,456 KB
testcase_04 AC 47 ms
49,364 KB
testcase_05 AC 48 ms
49,332 KB
testcase_06 AC 49 ms
49,196 KB
testcase_07 AC 50 ms
49,016 KB
testcase_08 AC 45 ms
49,272 KB
testcase_09 AC 441 ms
72,984 KB
testcase_10 AC 374 ms
72,928 KB
testcase_11 AC 440 ms
72,652 KB
testcase_12 AC 446 ms
73,072 KB
testcase_13 AC 443 ms
73,228 KB
testcase_14 AC 419 ms
73,104 KB
testcase_15 AC 417 ms
72,668 KB
testcase_16 AC 437 ms
73,196 KB
testcase_17 AC 445 ms
72,472 KB
testcase_18 AC 423 ms
73,304 KB
testcase_19 AC 444 ms
73,236 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no277;

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.Queue;

public class Main {

	@SuppressWarnings("unchecked")
	public static void main(String[] args) {
		IO io = new IO();
		int n = io.nextInt();
		ArrayList<Integer>[] graph = new ArrayList[n];
		for(int i=0;i<n;i++) {
			graph[i] = new ArrayList<>();
		}
		for(int i=0;i<n-1;i++) {
			int x = io.nextInt() - 1;
			int y = io.nextInt() - 1;
			graph[x].add(y);
			graph[y].add(x);
		}
		int[] dist = new int[n];
		Arrays.fill(dist, 1 << 29);
		Queue<Integer> q = new ArrayDeque<Integer>();
		q.add(0);
		dist[0] = 0;
		for(int i=0;i<n;i++) {
			if (graph[i].size() <= 1) {
				dist[i] = 0;
				q.add(i);
			}
		}
		while(!q.isEmpty()) {
			int v = q.poll();
			for(int u: graph[v]) {
				if (dist[u] > dist[v] + 1) {
					dist[u] = dist[v] + 1;
					q.offer(u);
				}
			}
		}
		for(int i=0;i<n;i++) {
			io.println(dist[i]);
		}
		io.flush();
	}


}
class IO extends PrintWriter {
	private final InputStream in;
	private final byte[] buffer = new byte[1024];
	private int ptr = 0;
	private int buflen = 0;

	public IO() { this(System.in);}
	public IO(InputStream source) { super(System.out); this.in = source;}
	private boolean hasNextByte() {
		if (ptr < buflen) {
			return true;
		}else{
			ptr = 0;
			try {
				buflen = in.read(buffer);
			} catch (IOException e) {
				e.printStackTrace();
			}
			if (buflen <= 0) {
				return false;
			}
		}
		return true;
	}
	private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
	private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
	private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}
	public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
	public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}
	public String next() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(isPrintableChar(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public char[] nextCharArray(int len) {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		char[] s = new char[len];
		int i = 0;
		int b = readByte();
		while(isPrintableChar(b)) {
			if (i == len) {
				throw new InputMismatchException();
			}
			s[i++] = (char) b;
			b = readByte();
		}
		return s;
	}
	public String nextLine() {
		if (!hasNextLine()) {
			throw new NoSuchElementException();
		}
		StringBuilder sb = new StringBuilder();
		int b = readByte();
		while(!isNewLine(b)) {
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	public long nextLong() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		long n = 0;
		boolean minus = false;
		int b = readByte();
		if (b == '-') {
			minus = true;
			b = readByte();
		}
		if (b < '0' || '9' < b) {
			throw new NumberFormatException();
		}
		while(true){
			if ('0' <= b && b <= '9') {
				n *= 10;
				n += b - '0';
			}else if(b == -1 || !isPrintableChar(b)){
				return minus ? -n : n;
			}else{
				throw new NumberFormatException();
			}
			b = readByte();
		}
	}
	public int nextInt() {
		long nl = nextLong();
		if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {
			throw new NumberFormatException();
		}
		return (int) nl;
	}
	public char nextChar() {
		if (!hasNext()) {
			throw new NoSuchElementException();
		}
		return (char) readByte();
	}
	public double nextDouble() { return Double.parseDouble(next());}
	public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}
	public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}
	public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}
	public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}
	public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}
	public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}
	public void close() { super.close(); try {in.close();} catch (IOException e) {}}
}
0