結果

問題 No.806 木を道に
ユーザー OlandOland
提出日時 2019-03-22 22:26:54
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,299 bytes
コンパイル時間 4,018 ms
コンパイル使用メモリ 79,488 KB
実行使用メモリ 72,168 KB
最終ジャッジ日時 2024-09-19 05:56:39
合計ジャッジ時間 9,857 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
36,208 KB
testcase_01 AC 48 ms
36,472 KB
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 55 ms
36,200 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 AC 57 ms
36,608 KB
testcase_08 WA -
testcase_09 AC 51 ms
36,628 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 AC 162 ms
50,456 KB
testcase_25 AC 232 ms
56,200 KB
testcase_26 AC 133 ms
48,128 KB
testcase_27 AC 268 ms
64,308 KB
testcase_28 AC 80 ms
37,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;
import java.util.Map.Entry;

public class Main {
	
	final boolean isDebug = false;
	String fileName = "input.txt";
	FastScanner sc;
	//PrintWriter out;
	final int MOD = (int)1e9+7;
	final int INF = Integer.MAX_VALUE / 2;
		
	/* solve */
	
	void solve() throws Exception{
		int N = sc.nextInt();
		ArrayList<ArrayList<Integer>> G = new ArrayList<ArrayList<Integer>>();
		for(int i = 0; i < N; i++) G.add(new ArrayList<Integer>());
		for(int i = 0; i < N-1; i++){
			int a = sc.nextInt()-1, b = sc.nextInt()-1;
			G.get(a).add(b); G.get(b).add(a);
		}
		
		boolean[] visited = new boolean[N];
		int endPoint = 0;
		Deque<Integer> queue = new ArrayDeque<Integer>();
		queue.addFirst(0);
		visited[0] = true;
		
		while(queue.size() != 0){
			int q = queue.removeFirst();
			visited[q] = true;
			boolean isEnd = true;
			for(int next : G.get(q)){
				if(!visited[next]){
					visited[next] = true;
					queue.addFirst(next);
					isEnd = false;
				}
			}
			if(isEnd) endPoint = q;
		}
		
		int[] dist = new int[N];
		Arrays.fill(dist, Integer.MAX_VALUE / 2);
		dist[endPoint] = 0;
		Deque<int[]> queue2 = new ArrayDeque<int[]>();
		queue2.addLast(new int[]{endPoint, 0});
		
		while(queue2.size() != 0){
			int[] q = queue2.removeFirst();
			int v = q[0], d = q[1];
			for(int next : G.get(v)){
				if(dist[next] > d + 1){
					dist[next] = d + 1;
					queue2.addLast(new int[]{next, d + 1});
				}
			}
		}
		
		int ans = 0;
		int[] distList = new int[N];
		for(int d : dist){
			if(distList[d] != 0) ans++;
			else distList[d]++;
		}
		System.out.println(ans);
	}
	
	/* end solve */
	
	/* main */
	public static void main(String[] args) throws Exception {
		new Main().m();
	}
	
	void m() throws Exception {
		long S = System.currentTimeMillis();
		sc = (isDebug) ? new FastScanner(new FileInputStream(fileName)) : new FastScanner(System.in);
		//out = new PrintWriter(System.out);
		solve();
		//out.flush();
		long G = System.currentTimeMillis();
		if(isDebug){
			System.out.println("---Debug---");
			System.out.printf("%8d ms", (G-S));
		}
	}
	/* end main */
}
/* end Main */

class FastScanner {
    private InputStream in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    public FastScanner(InputStream in) {
		this.in = in;
	}
    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;
    }
    public boolean hasNext() {
    	while(hasNextByte() && !isPrintableChar(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 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 double nextDouble() {
    	return Double.parseDouble(next());
    }
}
0