結果
問題 | No.1843 Tree ANDistance |
ユーザー | Shirotsume |
提出日時 | 2022-02-18 21:50:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 862 ms / 2,000 ms |
コード長 | 2,238 bytes |
コンパイル時間 | 289 ms |
コンパイル使用メモリ | 86,944 KB |
実行使用メモリ | 260,220 KB |
最終ジャッジ日時 | 2023-09-11 18:58:18 |
合計ジャッジ時間 | 19,140 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 820 ms
191,908 KB |
testcase_01 | AC | 795 ms
191,664 KB |
testcase_02 | AC | 750 ms
216,960 KB |
testcase_03 | AC | 774 ms
230,008 KB |
testcase_04 | AC | 824 ms
211,524 KB |
testcase_05 | AC | 620 ms
237,676 KB |
testcase_06 | AC | 682 ms
245,136 KB |
testcase_07 | AC | 783 ms
202,432 KB |
testcase_08 | AC | 814 ms
200,396 KB |
testcase_09 | AC | 762 ms
236,684 KB |
testcase_10 | AC | 761 ms
227,996 KB |
testcase_11 | AC | 862 ms
234,996 KB |
testcase_12 | AC | 638 ms
250,724 KB |
testcase_13 | AC | 684 ms
217,524 KB |
testcase_14 | AC | 218 ms
79,896 KB |
testcase_15 | AC | 218 ms
80,068 KB |
testcase_16 | AC | 175 ms
79,172 KB |
testcase_17 | AC | 171 ms
78,700 KB |
testcase_18 | AC | 139 ms
77,964 KB |
testcase_19 | AC | 163 ms
78,808 KB |
testcase_20 | AC | 168 ms
78,768 KB |
testcase_21 | AC | 75 ms
71,360 KB |
testcase_22 | AC | 75 ms
71,296 KB |
testcase_23 | AC | 75 ms
71,172 KB |
testcase_24 | AC | 75 ms
71,304 KB |
testcase_25 | AC | 75 ms
71,216 KB |
testcase_26 | AC | 75 ms
71,172 KB |
testcase_27 | AC | 75 ms
71,016 KB |
testcase_28 | AC | 654 ms
259,596 KB |
testcase_29 | AC | 519 ms
242,332 KB |
testcase_30 | AC | 503 ms
244,584 KB |
testcase_31 | AC | 658 ms
258,964 KB |
testcase_32 | AC | 654 ms
260,220 KB |
testcase_33 | AC | 235 ms
139,580 KB |
testcase_34 | AC | 500 ms
259,716 KB |
testcase_35 | AC | 73 ms
71,244 KB |
testcase_36 | AC | 72 ms
71,416 KB |
testcase_37 | AC | 75 ms
71,020 KB |
ソースコード
class dsu(): n=1 parent_or_size=[-1 for i in range(n)] def __init__(self,N): self.n=N self.parent_or_size=[-1 for i in range(N)] def merge(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) x=self.leader(a) y=self.leader(b) if x==y: return x if (-self.parent_or_size[x]<-self.parent_or_size[y]): x,y=y,x self.parent_or_size[x]+=self.parent_or_size[y] self.parent_or_size[y]=x return x def same(self,a,b): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) assert 0<=b<self.n, "0<=b<n,b={0},n={1}".format(b,self.n) return self.leader(a)==self.leader(b) def leader(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) if (self.parent_or_size[a]<0): return a self.parent_or_size[a]=self.leader(self.parent_or_size[a]) return self.parent_or_size[a] def size(self,a): assert 0<=a<self.n, "0<=a<n,a={0},n={1}".format(a,self.n) return -self.parent_or_size[self.leader(a)] def groups(self): leader_buf=[0 for i in range(self.n)] group_size=[0 for i in range(self.n)] for i in range(self.n): leader_buf[i]=self.leader(i) group_size[leader_buf[i]]+=1 result=[[] for i in range(self.n)] for i in range(self.n): result[leader_buf[i]].append(i) result2=[] for i in range(self.n): if len(result[i])>0: result2.append(result[i]) return result2 n = int(input()) mod = 10 ** 9 + 7 abc = [list(map(int,input().split())) for _ in range(n - 1)] ans = 0 bi2 = 1 for bit in range(32): U = dsu(n + 1) for i in range(n - 1): a, b, c = abc[i] a -= 1; b -= 1 if 1 & (c >> bit): U.merge(a, b) s = set() for i in range(n): x = U.leader(i) if x in s: continue else: s.add(x) c = U.size(i) ans += bi2 * c * (c - 1) // 2 ans %= mod bi2 *= 2 bi2 %= mod print(ans)