結果
問題 | No.2427 Tree Distance Two |
ユーザー |
![]() |
提出日時 | 2023-08-24 09:00:24 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 1,713 ms / 2,000 ms |
コード長 | 2,655 bytes |
コンパイル時間 | 3,320 ms |
コンパイル使用メモリ | 97,148 KB |
実行使用メモリ | 163,220 KB |
最終ジャッジ日時 | 2024-12-22 19:48:38 |
合計ジャッジ時間 | 31,949 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 35 |
ソースコード
import java.io.*;import java.util.*;import java.util.stream.*;public class Main {static ArrayList<ArrayList<Integer>> graph = new ArrayList<>();static int[] ans;public static void main(String[] args) throws Exception {Scanner sc = new Scanner();int n = sc.nextInt();for (int i = 0; i < n; i++) {graph.add(new ArrayList<>());}for (int i = 0; i < n - 1; i++) {int a = sc.nextInt() - 1;int b = sc.nextInt() - 1;graph.get(a).add(b);graph.get(b).add(a);}ans = new int[n];calc(0, 0);System.out.println(String.join("\n", Arrays.stream(ans).mapToObj(String::valueOf).toArray(String[]::new)));}static void calc(int idx, int p) {if (idx > 0) {ans[idx] += getParentCount(p);ans[idx] += getChildrenCount(p) - 1;}for (int x : graph.get(idx)) {if (p != x) {ans[idx] += getChildrenCount(x);calc(x, idx);}}}static int getParentCount(int x) {if (x > 0) {return 1;} else {return 0;}}static int getChildrenCount(int x) {if (x > 0) {return graph.get(x).size() - 1;} else {return graph.get(x).size();}}}class Utilities {static String arrayToLineString(Object[] arr) {return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));}static String arrayToLineString(int[] arr) {return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));}}class Scanner {BufferedReader br = new BufferedReader(new InputStreamReader(System.in));StringTokenizer st = new StringTokenizer("");StringBuilder sb = new StringBuilder();public Scanner() throws Exception {}public int nextInt() throws Exception {return Integer.parseInt(next());}public long nextLong() throws Exception {return Long.parseLong(next());}public double nextDouble() throws Exception {return Double.parseDouble(next());}public int[] nextIntArray() throws Exception {return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();}public String next() throws Exception {while (!st.hasMoreTokens()) {st = new StringTokenizer(br.readLine());}return st.nextToken();}}