結果
問題 | No.1843 Tree ANDistance |
ユーザー | Shirotsume |
提出日時 | 2022-02-18 21:45:22 |
言語 | PyPy3 (7.3.13) |
結果 |
AC
|
実行時間 | 1,039 ms / 2,000 ms |
コード長 | 2,212 bytes |
コンパイル時間 | 287 ms |
コンパイル使用メモリ | 86,904 KB |
実行使用メモリ | 260,344 KB |
最終ジャッジ日時 | 2023-09-11 18:52:47 |
合計ジャッジ時間 | 23,619 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,038 ms
204,920 KB |
testcase_01 | AC | 1,002 ms
207,488 KB |
testcase_02 | AC | 976 ms
218,432 KB |
testcase_03 | AC | 958 ms
217,328 KB |
testcase_04 | AC | 1,039 ms
236,060 KB |
testcase_05 | AC | 818 ms
245,336 KB |
testcase_06 | AC | 882 ms
236,836 KB |
testcase_07 | AC | 986 ms
198,904 KB |
testcase_08 | AC | 987 ms
206,148 KB |
testcase_09 | AC | 944 ms
230,656 KB |
testcase_10 | AC | 917 ms
235,672 KB |
testcase_11 | AC | 1,020 ms
205,692 KB |
testcase_12 | AC | 761 ms
239,816 KB |
testcase_13 | AC | 825 ms
232,168 KB |
testcase_14 | AC | 225 ms
80,128 KB |
testcase_15 | AC | 226 ms
79,608 KB |
testcase_16 | AC | 177 ms
78,624 KB |
testcase_17 | AC | 179 ms
78,604 KB |
testcase_18 | AC | 142 ms
78,064 KB |
testcase_19 | AC | 173 ms
79,196 KB |
testcase_20 | AC | 172 ms
78,600 KB |
testcase_21 | AC | 75 ms
71,328 KB |
testcase_22 | AC | 75 ms
71,304 KB |
testcase_23 | AC | 76 ms
71,192 KB |
testcase_24 | AC | 74 ms
71,376 KB |
testcase_25 | AC | 75 ms
71,268 KB |
testcase_26 | AC | 76 ms
71,212 KB |
testcase_27 | AC | 77 ms
71,324 KB |
testcase_28 | AC | 893 ms
259,880 KB |
testcase_29 | AC | 707 ms
221,460 KB |
testcase_30 | AC | 683 ms
244,592 KB |
testcase_31 | AC | 933 ms
259,776 KB |
testcase_32 | AC | 927 ms
260,344 KB |
testcase_33 | AC | 328 ms
139,620 KB |
testcase_34 | AC | 710 ms
259,600 KB |
testcase_35 | AC | 75 ms
71,184 KB |
testcase_36 | AC | 74 ms
71,220 KB |
testcase_37 | AC | 75 ms
71,216 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 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): if U.leader(i) in s: continue else: s.add(U.leader(i)) c = U.size(i) ans += pow(2, bit, mod) * c * (c - 1) // 2 ans %= mod print(ans)