結果
問題 | No.2494 Sum within Components |
ユーザー | FromBooska |
提出日時 | 2023-10-06 21:52:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 413 ms / 2,000 ms |
コード長 | 1,750 bytes |
コンパイル時間 | 283 ms |
コンパイル使用メモリ | 87,248 KB |
実行使用メモリ | 127,088 KB |
最終ジャッジ日時 | 2023-10-06 21:52:23 |
合計ジャッジ時間 | 5,219 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 94 ms
71,612 KB |
testcase_01 | AC | 93 ms
71,644 KB |
testcase_02 | AC | 94 ms
71,508 KB |
testcase_03 | AC | 93 ms
71,788 KB |
testcase_04 | AC | 93 ms
71,804 KB |
testcase_05 | AC | 119 ms
71,788 KB |
testcase_06 | AC | 92 ms
71,956 KB |
testcase_07 | AC | 93 ms
71,464 KB |
testcase_08 | AC | 92 ms
71,868 KB |
testcase_09 | AC | 164 ms
79,268 KB |
testcase_10 | AC | 184 ms
80,952 KB |
testcase_11 | AC | 148 ms
80,004 KB |
testcase_12 | AC | 210 ms
80,660 KB |
testcase_13 | AC | 227 ms
80,000 KB |
testcase_14 | AC | 358 ms
100,680 KB |
testcase_15 | AC | 330 ms
92,620 KB |
testcase_16 | AC | 253 ms
100,012 KB |
testcase_17 | AC | 223 ms
124,916 KB |
testcase_18 | AC | 247 ms
127,088 KB |
testcase_19 | AC | 413 ms
113,628 KB |
ソースコード
# Union Find 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 unite(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()) N, M = map(int, input().split()) UF = UnionFind(N+1) A = [0]+list(map(int, input().split())) for i in range(M): u, v = map(int, input().split()) if UF.same(u, v) == False: UF.unite(u, v) from collections import defaultdict ans = 1 mod = 998244353 for members in UF.all_group_members().values(): if members == [0]: continue s = 0 for m in members: s += A[m] ans *= pow(s, len(members), mod) ans %= mod print(ans)