結果
問題 | No.1843 Tree ANDistance |
ユーザー | moharan627 |
提出日時 | 2022-02-18 22:26:26 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,011 bytes |
コンパイル時間 | 311 ms |
コンパイル使用メモリ | 86,776 KB |
実行使用メモリ | 176,808 KB |
最終ジャッジ日時 | 2023-09-11 19:32:49 |
合計ジャッジ時間 | 37,435 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,937 ms
158,732 KB |
testcase_01 | AC | 1,889 ms
159,748 KB |
testcase_02 | AC | 1,976 ms
158,664 KB |
testcase_03 | AC | 1,867 ms
158,928 KB |
testcase_04 | TLE | - |
testcase_05 | AC | 1,501 ms
164,728 KB |
testcase_06 | AC | 1,449 ms
163,048 KB |
testcase_07 | AC | 1,585 ms
154,384 KB |
testcase_08 | AC | 1,864 ms
158,304 KB |
testcase_09 | AC | 1,704 ms
149,596 KB |
testcase_10 | AC | 1,749 ms
156,700 KB |
testcase_11 | AC | 1,862 ms
170,104 KB |
testcase_12 | AC | 1,390 ms
156,012 KB |
testcase_13 | AC | 1,509 ms
152,676 KB |
testcase_14 | AC | 165 ms
79,156 KB |
testcase_15 | AC | 173 ms
79,416 KB |
testcase_16 | AC | 142 ms
78,660 KB |
testcase_17 | AC | 146 ms
79,344 KB |
testcase_18 | AC | 144 ms
78,352 KB |
testcase_19 | AC | 167 ms
79,500 KB |
testcase_20 | AC | 144 ms
78,524 KB |
testcase_21 | AC | 89 ms
71,448 KB |
testcase_22 | AC | 90 ms
71,564 KB |
testcase_23 | AC | 91 ms
71,304 KB |
testcase_24 | AC | 91 ms
71,552 KB |
testcase_25 | AC | 91 ms
71,136 KB |
testcase_26 | AC | 91 ms
71,548 KB |
testcase_27 | AC | 91 ms
71,136 KB |
testcase_28 | AC | 1,271 ms
160,612 KB |
testcase_29 | AC | 621 ms
145,080 KB |
testcase_30 | AC | 830 ms
144,956 KB |
testcase_31 | AC | 1,297 ms
176,808 KB |
testcase_32 | AC | 1,327 ms
161,380 KB |
testcase_33 | AC | 345 ms
104,316 KB |
testcase_34 | AC | 859 ms
152,964 KB |
testcase_35 | AC | 91 ms
71,576 KB |
testcase_36 | AC | 91 ms
71,304 KB |
testcase_37 | AC | 93 ms
72,192 KB |
ソースコード
import sys #sys.setrecursionlimit(10 ** 6) INF = float('inf') #10**20,2**63に変えるのもあり MOD = 10**9 + 7 MOD2 = 998244353 from collections import defaultdict class UnionFind(): def __init__(self, n): self.n = n self.parents = [-1] * n def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return len(self.roots()) def all_group_members(self): group_members = defaultdict(list) for member in range(self.n): group_members[self.find(member)].append(member) return group_members def __str__(self): return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items()) def solve(): def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LC(): return list(input()) def IC(): return [int(c) for c in input()] def MI(): return map(int, sys.stdin.readline().split()) N = II() Graph = [[] for _ in range(N)] for _ in range(N-1): A,B,C =MI() A-=1 B-=1 Graph[A].append((B,C)) Graph[B].append((A,C)) from collections import deque Ans = 0 for bit in range(30): Q = deque() Seen = [False for i in range(N)] uf = UnionFind(N) for u in range(N): if (Seen[u] == True): # 始点sが探索済みなら continue else: Q.append(u) # 始点をキューに入れる while Q: s = Q.pop() Seen[s] = True # 0,→sで初めてたどり着いたときに行う処理はここで for t,c in Graph[s]: if Seen[t] == False and c & (1 << bit): uf.union(s,t) Q.append(t) Flag = defaultdict(lambda:True) Num = 2 ** bit for n in range(N): if Flag[uf.find(n)] == True: Flag[uf.find(n)] = False Size = uf.size(n) Size -=1 tmp = Size*(Size+1)//2 tmp %= MOD Ans += tmp* Num Ans %= MOD print(Ans % MOD) return solve()