結果
問題 |
No.1843 Tree ANDistance
|
ユーザー |
![]() |
提出日時 | 2023-04-26 15:43:31 |
言語 | Java (openjdk 23) |
結果 |
AC
|
実行時間 | 556 ms / 2,000 ms |
コード長 | 3,409 bytes |
コンパイル時間 | 3,095 ms |
コンパイル使用メモリ | 91,316 KB |
実行使用メモリ | 59,396 KB |
最終ジャッジ日時 | 2024-11-15 22:56:17 |
合計ジャッジ時間 | 18,295 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 38 |
ソースコード
import java.io.*; import java.util.*; import java.util.stream.*; 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[] values = new int[n - 1]; for (int i = 0; i < n - 1; i++) { lefts[i] = sc.nextInt() - 1; rights[i] = sc.nextInt() - 1; values[i] = sc.nextInt(); } UnionFindTree uft = new UnionFindTree(n); long ans = 0; for (int i = 0; i < 30; i++) { uft.clear(); for (int j = 0; j < n - 1; j++) { if ((values[j] & (1 << i)) > 0) { uft.unite(lefts[j], rights[j]); } } long tmp = 0; for (int j = 0; j < n; j++) { if (j == uft.find(j)) { long count = uft.counts[j]; tmp += count * (count - 1) / 2; tmp %= MOD; } } ans += tmp * (1 << i); 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) { parents[xx] = yy; counts[yy] += counts[xx]; } } } } 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(); } }