結果
問題 | No.1843 Tree ANDistance |
ユーザー | tenten |
提出日時 | 2022-02-21 14:51:14 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 542 ms / 2,000 ms |
コード長 | 2,822 bytes |
コンパイル時間 | 3,023 ms |
コンパイル使用メモリ | 74,008 KB |
実行使用メモリ | 60,576 KB |
最終ジャッジ日時 | 2023-09-12 06:22:37 |
合計ジャッジ時間 | 18,510 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 494 ms
58,156 KB |
testcase_01 | AC | 477 ms
57,088 KB |
testcase_02 | AC | 542 ms
59,564 KB |
testcase_03 | AC | 501 ms
57,968 KB |
testcase_04 | AC | 464 ms
59,456 KB |
testcase_05 | AC | 509 ms
58,324 KB |
testcase_06 | AC | 518 ms
60,576 KB |
testcase_07 | AC | 537 ms
59,724 KB |
testcase_08 | AC | 458 ms
56,620 KB |
testcase_09 | AC | 424 ms
57,876 KB |
testcase_10 | AC | 520 ms
59,784 KB |
testcase_11 | AC | 493 ms
57,996 KB |
testcase_12 | AC | 436 ms
57,580 KB |
testcase_13 | AC | 507 ms
58,084 KB |
testcase_14 | AC | 141 ms
53,100 KB |
testcase_15 | AC | 140 ms
52,816 KB |
testcase_16 | AC | 119 ms
50,892 KB |
testcase_17 | AC | 117 ms
53,144 KB |
testcase_18 | AC | 72 ms
51,752 KB |
testcase_19 | AC | 148 ms
53,376 KB |
testcase_20 | AC | 126 ms
53,032 KB |
testcase_21 | AC | 43 ms
49,296 KB |
testcase_22 | AC | 42 ms
49,424 KB |
testcase_23 | AC | 42 ms
49,204 KB |
testcase_24 | AC | 42 ms
49,384 KB |
testcase_25 | AC | 41 ms
49,784 KB |
testcase_26 | AC | 41 ms
49,304 KB |
testcase_27 | AC | 42 ms
49,392 KB |
testcase_28 | AC | 345 ms
57,760 KB |
testcase_29 | AC | 317 ms
57,024 KB |
testcase_30 | AC | 304 ms
57,272 KB |
testcase_31 | AC | 380 ms
58,888 KB |
testcase_32 | AC | 344 ms
57,604 KB |
testcase_33 | AC | 227 ms
55,988 KB |
testcase_34 | AC | 381 ms
59,080 KB |
testcase_35 | AC | 41 ms
49,292 KB |
testcase_36 | AC | 42 ms
49,596 KB |
testcase_37 | AC | 44 ms
49,424 KB |
ソースコード
import java.io.*; import java.util.*; public class Main { static final int MOD = 1000000007; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); int[] lefts = new int[n - 1]; int[] rights = new int[n - 1]; int[] costs = new int[n - 1]; for (int i = 0; i < n - 1; i ++) { lefts[i] = sc.nextInt() - 1; rights[i] = sc.nextInt() - 1; costs[i] = sc.nextInt(); } UnionFindTree uft = new UnionFindTree(n); long ans = 0; for (int i = 0; i < 30; i++) { uft.clear(); int base = (1 << i); for (int j = 0; j < n - 1; j++) { if ((costs[j] & base) != 0) { uft.unite(lefts[j], rights[j]); } } boolean[] used = new boolean[n]; for (int j = 0; j < n; j++) { int x = uft.find(j); if (used[x]) { continue; } used[x] = true; ans += (long)(uft.counts[x]) * (uft.counts[x] - 1) / 2 % MOD * base % MOD; ans %= MOD; } } System.out.println(ans); } static class UnionFindTree { int[] parents; int[] counts; public UnionFindTree(int size) { parents = new int[size]; counts = new int[size]; } public void clear() { for (int i = 0; i < parents.length; i++) { parents[i] = i; counts[i] = 1; } } public int find(int x) { if (x == parents[x]) { return x; } else { return parents[x] = find(parents[x]); } } public boolean same(int x, int y) { return find(x) == find(y); } public void unite(int x, int y) { int xx = find(x); int yy = find(y); if (xx == yy) { return; } parents[xx] = yy; counts[yy] += counts[xx]; } } } class Scanner { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer st = new StringTokenizer(""); public Scanner() throws Exception { } public int nextInt() throws Exception { return Integer.parseInt(next()); } public long nextLong() throws Exception { return Long.parseLong(next()); } public String next() throws Exception { if (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } return st.nextToken(); } }