結果
問題 | No.1266 7 Colors |
ユーザー | 👑 rin204 |
提出日時 | 2022-07-09 16:02:21 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,052 ms / 3,000 ms |
コード長 | 2,206 bytes |
コンパイル時間 | 311 ms |
コンパイル使用メモリ | 87,292 KB |
実行使用メモリ | 99,968 KB |
最終ジャッジ日時 | 2023-08-29 23:28:00 |
合計ジャッジ時間 | 19,337 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 70 ms
71,436 KB |
testcase_01 | AC | 70 ms
71,452 KB |
testcase_02 | AC | 71 ms
71,580 KB |
testcase_03 | AC | 612 ms
86,388 KB |
testcase_04 | AC | 958 ms
98,172 KB |
testcase_05 | AC | 629 ms
87,228 KB |
testcase_06 | AC | 973 ms
97,284 KB |
testcase_07 | AC | 1,024 ms
98,996 KB |
testcase_08 | AC | 997 ms
98,468 KB |
testcase_09 | AC | 860 ms
93,264 KB |
testcase_10 | AC | 868 ms
93,204 KB |
testcase_11 | AC | 721 ms
89,648 KB |
testcase_12 | AC | 797 ms
91,120 KB |
testcase_13 | AC | 793 ms
90,476 KB |
testcase_14 | AC | 623 ms
87,520 KB |
testcase_15 | AC | 1,052 ms
99,968 KB |
testcase_16 | AC | 743 ms
90,416 KB |
testcase_17 | AC | 1,009 ms
98,524 KB |
testcase_18 | AC | 525 ms
98,792 KB |
testcase_19 | AC | 378 ms
95,720 KB |
testcase_20 | AC | 386 ms
96,028 KB |
testcase_21 | AC | 433 ms
81,620 KB |
ソースコード
class UnionFind: def __init__(self, n): self.n = n self.parents = [-1] * n self.group = 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 self.group -= 1 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 self.group def all_group_members(self): dic = {r:[] for r in self.roots()} for i in range(self.n): dic[self.find(i)].append(i) return dic def __str__(self): return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) n, m, q = map(int, input().split()) S = [int(input()[::-1], 2) for _ in range(n)] edges = [[] for _ in range(n)] for _ in range(m): u, v = map(int, input().split()) u -= 1 v -= 1 edges[u].append(v) edges[v].append(u) UF = UnionFind(7 * n) for u in range(n): for v in edges[u]: for c in range(7): if S[u] >> c & 1 and S[v] >> c & 1: UF.union(7 * u + c, 7 * v + c) for c in range(7): c2 = (c + 1) % 7 if S[u] >> c & 1 and S[u] >> c2 & 1: UF.union(7 * u + c, 7 * u + c2) for _ in range(q): t, x, y = map(int, input().split()) x -= 1 y -= 1 if t == 1: S[x] |= 1 << y for v in edges[x]: if S[v] >> y & 1: UF.union(7 * x + y, 7 * v + y) for c in [(y - 1) % 7, (y + 1) % 7]: if S[x] >> c & 1: UF.union(7 * x + y, 7 * x + c) else: print(UF.size(7 * x))