結果
問題 | No.1266 7 Colors |
ユーザー | nagiss |
提出日時 | 2020-10-24 02:40:19 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 1,910 ms / 3,000 ms |
コード長 | 2,316 bytes |
コンパイル時間 | 97 ms |
コンパイル使用メモリ | 11,200 KB |
実行使用メモリ | 60,260 KB |
最終ジャッジ日時 | 2023-09-28 20:02:03 |
合計ジャッジ時間 | 24,902 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 18 ms
8,180 KB |
testcase_01 | AC | 18 ms
8,440 KB |
testcase_02 | AC | 20 ms
8,356 KB |
testcase_03 | AC | 1,038 ms
27,884 KB |
testcase_04 | AC | 1,176 ms
49,964 KB |
testcase_05 | AC | 1,019 ms
29,688 KB |
testcase_06 | AC | 1,215 ms
53,832 KB |
testcase_07 | AC | 1,282 ms
59,280 KB |
testcase_08 | AC | 1,192 ms
51,064 KB |
testcase_09 | AC | 1,101 ms
42,992 KB |
testcase_10 | AC | 1,090 ms
40,268 KB |
testcase_11 | AC | 1,030 ms
32,060 KB |
testcase_12 | AC | 1,040 ms
34,668 KB |
testcase_13 | AC | 1,100 ms
37,112 KB |
testcase_14 | AC | 1,025 ms
29,484 KB |
testcase_15 | AC | 1,294 ms
60,260 KB |
testcase_16 | AC | 1,039 ms
35,288 KB |
testcase_17 | AC | 1,263 ms
57,948 KB |
testcase_18 | AC | 1,887 ms
56,384 KB |
testcase_19 | AC | 1,901 ms
58,600 KB |
testcase_20 | AC | 1,910 ms
58,552 KB |
testcase_21 | AC | 311 ms
21,480 KB |
ソースコード
import sys class UnionFind: def __init__(self, N): self.p = list(range(N)) self.size = [1] * N def root(self, x): p = self.p[x] stk = [] while x != p: stk.append(x) p, x = self.p[p], p for c in stk: self.p[c] = p return p def same(self, x, y): return self.root(x) == self.root(y) def unite(self, x, y): u = self.root(x) v = self.root(y) if u == v: return if self.size[u] < self.size[v]: self.p[u] = v self.size[v] += self.size[u] self.size[u] = 0 else: self.p[v] = u self.size[u] += self.size[v] self.size[v] = 0 def count(self, x): return self.size[self.root(x)] def main(): input = sys.stdin.buffer.readline N, M, Q = map(int, input().split()) S = [int(input(), 2) for _ in range(N)] G = [[] for _ in range(N)] for i in range(M): u, v = map(int, input().split()) u -= 1 v -= 1 G[u].append(v) G[v].append(u) uf = UnionFind(7 * N) for v, s in enumerate(S): ones = [i for i in range(7) if s>>(6-i)&1] v_offset = 7 * v if len(ones) >= 2: for o1, o2 in zip(ones, ones[1:]): if o1 + 1 == o2: uf.unite(v_offset+o1, v_offset+o2) if ones[0] == 0 and ones[-1] == 6: uf.unite(v_offset, v_offset+6) for u in G[v]: for o in ones: if S[u]>>(6-o)&1: uf.unite(v_offset+o, u*7+o) Ans = [] for _ in range(Q): t, x, y = map(int, input().split()) x -= 1 if t == 1: v_offset = x * 7 d = 7-y S[x] |= 1 << d v = v_offset + (y-1) d2 = (d-1)%7 if S[x] >> d2 & 1: uf.unite(v, v_offset+y%7) d2 = (d+1)%7 if S[x] >> d2 & 1: uf.unite(v, v_offset+(y-2)%7) for u in G[x]: if S[u]>>d&1: u = u * 7 + y-1 uf.unite(v, u) else: ans = uf.count(x*7) Ans.append(ans) print("\n".join(map(str, Ans))) main()