結果
問題 | No.1843 Tree ANDistance |
ユーザー | 37zigen |
提出日時 | 2022-02-18 22:13:41 |
言語 | Java21 (openjdk 21) |
結果 |
AC
|
実行時間 | 329 ms / 2,000 ms |
コード長 | 3,514 bytes |
コンパイル時間 | 2,851 ms |
コンパイル使用メモリ | 74,808 KB |
実行使用メモリ | 56,516 KB |
最終ジャッジ日時 | 2023-09-11 19:19:07 |
合計ジャッジ時間 | 11,875 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 329 ms
56,468 KB |
testcase_01 | AC | 324 ms
54,416 KB |
testcase_02 | AC | 309 ms
56,516 KB |
testcase_03 | AC | 320 ms
54,136 KB |
testcase_04 | AC | 317 ms
56,144 KB |
testcase_05 | AC | 322 ms
56,112 KB |
testcase_06 | AC | 326 ms
56,148 KB |
testcase_07 | AC | 310 ms
55,560 KB |
testcase_08 | AC | 320 ms
56,148 KB |
testcase_09 | AC | 305 ms
55,764 KB |
testcase_10 | AC | 318 ms
56,080 KB |
testcase_11 | AC | 317 ms
55,812 KB |
testcase_12 | AC | 308 ms
55,740 KB |
testcase_13 | AC | 315 ms
55,916 KB |
testcase_14 | AC | 99 ms
52,760 KB |
testcase_15 | AC | 100 ms
52,372 KB |
testcase_16 | AC | 73 ms
52,320 KB |
testcase_17 | AC | 80 ms
52,348 KB |
testcase_18 | AC | 60 ms
50,088 KB |
testcase_19 | AC | 106 ms
53,236 KB |
testcase_20 | AC | 86 ms
50,400 KB |
testcase_21 | AC | 45 ms
49,304 KB |
testcase_22 | AC | 46 ms
49,164 KB |
testcase_23 | AC | 45 ms
49,120 KB |
testcase_24 | AC | 46 ms
49,312 KB |
testcase_25 | AC | 45 ms
49,580 KB |
testcase_26 | AC | 45 ms
49,472 KB |
testcase_27 | AC | 46 ms
49,684 KB |
testcase_28 | AC | 268 ms
55,212 KB |
testcase_29 | AC | 217 ms
55,684 KB |
testcase_30 | AC | 218 ms
53,952 KB |
testcase_31 | AC | 277 ms
55,956 KB |
testcase_32 | AC | 280 ms
56,296 KB |
testcase_33 | AC | 168 ms
54,632 KB |
testcase_34 | AC | 237 ms
55,292 KB |
testcase_35 | AC | 45 ms
49,388 KB |
testcase_36 | AC | 45 ms
49,244 KB |
testcase_37 | AC | 46 ms
49,156 KB |
ソースコード
import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.util.Arrays; import java.util.NoSuchElementException; class Main { public static void main(String[] args) { new Main().run(); } void run() { solve(); } class DSU { int[] parent; public DSU(int n) { parent=new int[n]; Arrays.fill(parent, -1); } int root(int x) { return parent[x] < 0 ? x : (parent[x]=root(parent[x])); } boolean equiv(int x, int y) { return root(x) == root(y); } int sz(int x) { return -parent[root(x)]; } void union(int x, int y) { x=root(x);y=root(y); if (x==y) return; if (sz(x)<sz(y)) { x^=y;y^=x;x^=y; } parent[y]+=parent[x]; parent[x]=y; } boolean isroot(int x) { return parent[x]<0; } } void solve() { FastScanner sc=new FastScanner(); PrintWriter pw=new PrintWriter(System.out); int N=sc.nextInt(); int[] A=new int[N-1]; int[] B=new int[N-1]; int[] C=new int[N-1]; for (int i=0;i<N-1;++i) { A[i]=sc.nextInt()-1; B[i]=sc.nextInt()-1; C[i]=sc.nextInt(); } long ans=0; long mod=(long) 1e9+7; for (int b=0;b<30;++b) { DSU dsu=new DSU(N); for (int i=0;i<N-1;++i) { if ((C[i]>>b)%2==0) continue; dsu.union(A[i], B[i]); } for (int i=0;i<N;++i) if (dsu.isroot(i)) { ans+=(1L<<b)*(1L*dsu.sz(i)*(dsu.sz(i)-1)/2 % mod) %mod; ans%=mod; } } System.out.println(ans); pw.close(); } static void tr(Object...objects) { System.out.println(Arrays.deepToString(objects)); } } class FastScanner { private final InputStream in = System.in; private final byte[] buffer = new byte[1024]; private int ptr = 0; private int buflen = 0; private boolean hasNextByte() { if (ptr < buflen) { return true; }else{ ptr = 0; try { buflen = in.read(buffer); } catch (IOException e) { e.printStackTrace(); } if (buflen <= 0) { return false; } } return true; } private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;} private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;} private void skipUnprintable() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;} public boolean hasNext() { skipUnprintable(); return hasNextByte();} public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while(isPrintableChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); long n = 0; boolean minus = false; int b = readByte(); if (b == '-') { minus = true; b = readByte(); } if (b < '0' || '9' < b) { throw new NumberFormatException(); } while(true){ if ('0' <= b && b <= '9') { n *= 10; n += b - '0'; }else if(b == -1 || !isPrintableChar(b)){ return minus ? -n : n; }else{ throw new NumberFormatException(); } b = readByte(); } } public int nextInt() { return (int)nextLong(); } }