結果
問題 | No.1207 グラフX |
ユーザー | mkawa2 |
提出日時 | 2021-08-26 11:46:37 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 848 ms / 2,000 ms |
コード長 | 2,156 bytes |
コンパイル時間 | 182 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 167,680 KB |
最終ジャッジ日時 | 2024-04-29 07:31:13 |
合計ジャッジ時間 | 34,015 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 703 ms
164,736 KB |
testcase_01 | AC | 718 ms
162,304 KB |
testcase_02 | AC | 794 ms
159,744 KB |
testcase_03 | AC | 709 ms
150,784 KB |
testcase_04 | AC | 709 ms
162,304 KB |
testcase_05 | AC | 835 ms
158,464 KB |
testcase_06 | AC | 848 ms
158,848 KB |
testcase_07 | AC | 844 ms
158,464 KB |
testcase_08 | AC | 617 ms
126,336 KB |
testcase_09 | AC | 664 ms
135,168 KB |
testcase_10 | AC | 842 ms
150,272 KB |
testcase_11 | AC | 836 ms
159,360 KB |
testcase_12 | AC | 617 ms
131,328 KB |
testcase_13 | AC | 379 ms
100,352 KB |
testcase_14 | AC | 725 ms
159,616 KB |
testcase_15 | AC | 652 ms
146,304 KB |
testcase_16 | AC | 379 ms
99,584 KB |
testcase_17 | AC | 525 ms
122,240 KB |
testcase_18 | AC | 448 ms
118,016 KB |
testcase_19 | AC | 531 ms
112,512 KB |
testcase_20 | AC | 755 ms
152,832 KB |
testcase_21 | AC | 134 ms
80,896 KB |
testcase_22 | AC | 568 ms
126,208 KB |
testcase_23 | AC | 577 ms
126,080 KB |
testcase_24 | AC | 445 ms
117,248 KB |
testcase_25 | AC | 736 ms
154,624 KB |
testcase_26 | AC | 596 ms
135,296 KB |
testcase_27 | AC | 672 ms
145,408 KB |
testcase_28 | AC | 675 ms
146,176 KB |
testcase_29 | AC | 652 ms
152,192 KB |
testcase_30 | AC | 395 ms
103,168 KB |
testcase_31 | AC | 351 ms
96,256 KB |
testcase_32 | AC | 356 ms
105,472 KB |
testcase_33 | AC | 372 ms
103,680 KB |
testcase_34 | AC | 639 ms
135,296 KB |
testcase_35 | AC | 157 ms
81,664 KB |
testcase_36 | AC | 613 ms
140,288 KB |
testcase_37 | AC | 559 ms
126,976 KB |
testcase_38 | AC | 247 ms
87,680 KB |
testcase_39 | AC | 379 ms
106,880 KB |
testcase_40 | AC | 282 ms
93,056 KB |
testcase_41 | AC | 504 ms
110,080 KB |
testcase_42 | AC | 43 ms
52,352 KB |
testcase_43 | AC | 43 ms
52,480 KB |
testcase_44 | AC | 43 ms
52,736 KB |
testcase_45 | AC | 660 ms
167,680 KB |
testcase_46 | AC | 645 ms
167,308 KB |
testcase_47 | AC | 649 ms
167,432 KB |
testcase_48 | AC | 675 ms
167,308 KB |
ソースコード
import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 p2D = lambda x: print(*x, sep="\n") def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() # dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = 10**9 # md = 998244353 md = 10**9+7 class UnionFind: def __init__(self, n): self.state = [-1]*n self.size_table = [1]*n # cntはグループ数 self.cnt = n def root(self, u): stack = [] while self.state[u] >= 0: stack.append(u) u = self.state[u] for v in stack: self.state[v] = u return u def same(self, u, v): return self.root(u) == self.root(v) def merge(self, u, v): u = self.root(u) v = self.root(v) if u == v: return False du = -self.state[u] dv = -self.state[v] if du < dv: u, v = v, u if du == dv: self.state[u] -= 1 self.state[v] = u self.cnt -= 1 self.size_table[u] += self.size_table[v] return True # グループの要素数 def size(self, u): return self.size_table[self.root(u)] n, m, x = LI() xyz = LLI(m) to = [[] for _ in range(n)] uf = UnionFind(n) xyz.sort(key=lambda x: x[2]) for u, v, z in xyz: u, v = u-1, v-1 if not uf.merge(u, v): continue to[u].append((v, z)) to[v].append((u, z)) size = [1]*n ans = 0 stack = [(0, -1, True)] while stack: u, par, first = stack.pop() if first: stack.append((u, par, False)) for v, z in to[u]: if v == par: continue stack.append((v, u, True)) else: for v, z in to[u]: if v == par: continue ans += size[v]*(n-size[v])*pow(x, z, md)%md size[u] += size[v] ans %= md print(ans)