結果
問題 | No.1843 Tree ANDistance |
ユーザー | nishi5451 |
提出日時 | 2022-02-20 20:50:35 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,978 bytes |
コンパイル時間 | 3,131 ms |
コンパイル使用メモリ | 76,000 KB |
実行使用メモリ | 61,372 KB |
最終ジャッジ日時 | 2023-09-11 21:11:33 |
合計ジャッジ時間 | 11,963 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 282 ms
58,988 KB |
testcase_01 | AC | 285 ms
58,920 KB |
testcase_02 | AC | 276 ms
58,796 KB |
testcase_03 | AC | 307 ms
59,464 KB |
testcase_04 | AC | 305 ms
59,252 KB |
testcase_05 | WA | - |
testcase_06 | AC | 328 ms
59,288 KB |
testcase_07 | AC | 280 ms
58,020 KB |
testcase_08 | AC | 286 ms
61,372 KB |
testcase_09 | AC | 321 ms
59,228 KB |
testcase_10 | AC | 312 ms
59,004 KB |
testcase_11 | AC | 326 ms
59,712 KB |
testcase_12 | AC | 250 ms
58,296 KB |
testcase_13 | AC | 264 ms
56,192 KB |
testcase_14 | AC | 83 ms
52,520 KB |
testcase_15 | AC | 97 ms
52,876 KB |
testcase_16 | AC | 66 ms
52,080 KB |
testcase_17 | AC | 67 ms
51,736 KB |
testcase_18 | AC | 52 ms
49,256 KB |
testcase_19 | AC | 95 ms
52,620 KB |
testcase_20 | AC | 83 ms
52,352 KB |
testcase_21 | AC | 44 ms
49,748 KB |
testcase_22 | AC | 43 ms
49,232 KB |
testcase_23 | AC | 43 ms
49,332 KB |
testcase_24 | AC | 43 ms
49,564 KB |
testcase_25 | AC | 43 ms
49,168 KB |
testcase_26 | AC | 43 ms
49,468 KB |
testcase_27 | AC | 44 ms
49,708 KB |
testcase_28 | AC | 182 ms
55,576 KB |
testcase_29 | AC | 211 ms
57,056 KB |
testcase_30 | WA | - |
testcase_31 | AC | 215 ms
58,912 KB |
testcase_32 | AC | 217 ms
56,632 KB |
testcase_33 | AC | 158 ms
53,776 KB |
testcase_34 | AC | 217 ms
56,844 KB |
testcase_35 | AC | 44 ms
49,264 KB |
testcase_36 | AC | 44 ms
47,344 KB |
testcase_37 | AC | 45 ms
49,180 KB |
ソースコード
import java.util.*; import java.util.stream.*; import java.io.*; class UFT { int[] par; int[] rank; int[] size; int n; int groups; public UFT(int n){ this.n = n; groups = n; par = new int[n]; rank = new int[n]; size = new int[n]; for(int i = 0; i < n; i++){ par[i] = i; rank[i] = 0; size[i] = 1; } } public int root(int x){ if(par[x] == x) return x; else return par[x] = root(par[x]); } public boolean merge(int x, int y){ x = root(x); y = root(y); if(x == y) return false; if(rank[x] < rank[y]){ par[x] = y; size[y] += size[x]; size[x] = 0; } else { par[y] = x; size[x] += size[y]; size[y] = 0; if(rank[x] == rank[y]) rank[x]++; } groups--; return true; } public boolean isSame(int x, int y){ return root(x) == root(y); } public boolean isConnected(){ int s = root(0); if(s == n) return true; else return false; } public int connectedComponents(){ return groups; } public int groupSize(int i){ return size[root(i)]; } } public class Main { static final int INF = 1<<30; static final long INFL = 1L<<60; static final int MOD = 1000000007; static final int MOD2 = 998244353; static List<List<Integer>> g; public static void main(String[] args) { FastScanner fs = new FastScanner(); PrintWriter pw = new PrintWriter(System.out); int n = fs.nextInt(); int[] a = new int[n-1]; int[] b = new int[n-1]; long[] c = new long[n-1]; for(int i = 0; i < n-1; i++){ a[i] = fs.nextInt() - 1; b[i] = fs.nextInt() - 1; c[i] = fs.nextLong(); } long ans = 0; for(int i = 0; i < 31; i++){ UFT uft = new UFT(n); for(int j = 0; j < n-1; j++){ if((c[j] & 1L<<i) > 0){ uft.merge(a[j], b[j]); } } long cnt = 0; for(int j = 0; j < n; j++){ if(uft.root(j) == j){ long size = uft.size[j] * (uft.size[j] - 1) / 2; size %= MOD; cnt = (cnt + size) % MOD; } } ans = (ans + (cnt * 1L<<i) % MOD) % MOD; } pw.println(ans); pw.close(); } } class FastScanner { private InputStream in = System.in; private byte[] buffer = new byte[1024]; private int length = 0, p = 0; private boolean hasNextByte() { if (p < length) return true; else{ p = 0; try{ length = in.read(buffer); }catch(Exception e){ e.printStackTrace(); } if(length == 0) return false; } return true; } private int readByte() { if (hasNextByte() == true) return buffer[p++]; return -1; } private static boolean isPrintable(int n) { return 33 <= n && n <= 126; } private void skip() { while (hasNextByte() && !isPrintable(buffer[p])) p++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int temp = readByte(); while (isPrintable(temp)) { sb.appendCodePoint(temp); temp = readByte(); } return sb.toString(); } public int nextInt() { return Math.toIntExact(nextLong()); } public int[] nextInts(int n) { int[] ar = new int[n]; for (int i = 0; i < n; i++) ar[i] = nextInt(); return ar; } public long[] nextLongs(int n) { long[] ar = new long[n]; for (int i = 0; i < n; i++) ar[i] = nextLong(); return ar; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); boolean minus = false; int temp = readByte(); if (temp == '-') { minus = true; temp = readByte(); } if (temp < '0' || '9' < temp) throw new NumberFormatException(); long n = 0; while (isPrintable(temp)) { if ('0' <= temp && temp <= '9') { n *= 10; n += temp - '0'; } temp = readByte(); } return minus ? -n : n; } public char[] nextChars() { String s = next(); return s.toCharArray(); } public char[][] nextCharMat(int h, int w) { char[][] ar = new char[h][w]; for(int i = 0; i < h; i++){ String s = next(); for(int j = 0; j < w; j++){ ar[i][j] = s.charAt(j); } } return ar; } }