結果
問題 | No.1418 Sum of Sum of Subtree Size |
ユーザー |
![]() |
提出日時 | 2023-01-12 14:28:50 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 628 ms / 2,000 ms |
コード長 | 2,266 bytes |
コンパイル時間 | 2,679 ms |
コンパイル使用メモリ | 95,336 KB |
実行使用メモリ | 77,512 KB |
最終ジャッジ日時 | 2024-12-23 07:44:26 |
合計ジャッジ時間 | 15,849 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 41 |
ソースコード
import java.io.*;import java.util.*;import java.util.stream.*;public class Main {static int n;static ArrayList<ArrayList<Integer>> graph = new ArrayList<>();static long total = 0;public static void main(String[] args) throws Exception {Scanner sc = new Scanner();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);}getCount(0, 0);System.out.println(total);}static long getCount(int idx, int p) {long count = 1;for (int x : graph.get(idx)) {if (x != p) {long tmp = getCount(x, idx);total += (n - tmp) * tmp;count += tmp;}}total += (n - count) * count;total += n;return count;}}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();}}