結果
問題 | No.1843 Tree ANDistance |
ユーザー | Shirotsume |
提出日時 | 2022-02-18 21:54:34 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 545 ms / 2,000 ms |
コード長 | 2,126 bytes |
コンパイル時間 | 776 ms |
コンパイル使用メモリ | 86,816 KB |
実行使用メモリ | 114,388 KB |
最終ジャッジ日時 | 2023-09-11 19:03:25 |
合計ジャッジ時間 | 13,501 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 514 ms
104,700 KB |
testcase_01 | AC | 498 ms
107,236 KB |
testcase_02 | AC | 479 ms
114,140 KB |
testcase_03 | AC | 480 ms
113,856 KB |
testcase_04 | AC | 513 ms
106,844 KB |
testcase_05 | AC | 364 ms
113,544 KB |
testcase_06 | AC | 423 ms
114,388 KB |
testcase_07 | AC | 499 ms
113,140 KB |
testcase_08 | AC | 502 ms
108,344 KB |
testcase_09 | AC | 449 ms
110,664 KB |
testcase_10 | AC | 464 ms
109,948 KB |
testcase_11 | AC | 545 ms
110,356 KB |
testcase_12 | AC | 361 ms
110,548 KB |
testcase_13 | AC | 387 ms
110,588 KB |
testcase_14 | AC | 182 ms
78,848 KB |
testcase_15 | AC | 186 ms
78,744 KB |
testcase_16 | AC | 146 ms
78,484 KB |
testcase_17 | AC | 148 ms
78,732 KB |
testcase_18 | AC | 121 ms
78,028 KB |
testcase_19 | AC | 134 ms
78,672 KB |
testcase_20 | AC | 142 ms
78,616 KB |
testcase_21 | AC | 75 ms
71,164 KB |
testcase_22 | AC | 76 ms
71,416 KB |
testcase_23 | AC | 74 ms
71,136 KB |
testcase_24 | AC | 76 ms
71,236 KB |
testcase_25 | AC | 76 ms
71,364 KB |
testcase_26 | AC | 76 ms
70,968 KB |
testcase_27 | AC | 75 ms
71,268 KB |
testcase_28 | AC | 347 ms
106,404 KB |
testcase_29 | AC | 293 ms
97,500 KB |
testcase_30 | AC | 296 ms
98,472 KB |
testcase_31 | AC | 370 ms
108,336 KB |
testcase_32 | AC | 355 ms
107,532 KB |
testcase_33 | AC | 158 ms
86,804 KB |
testcase_34 | AC | 271 ms
100,204 KB |
testcase_35 | AC | 75 ms
71,132 KB |
testcase_36 | AC | 77 ms
71,132 KB |
testcase_37 | AC | 74 ms
71,132 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[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) for i in range(n): x = U.size(i) if x > 1: ans += bi2 * (x - 1) * x // 2 ans %= mod bi2 *= 2 bi2 %= mod print(ans)