結果
問題 | No.1266 7 Colors |
ユーザー |
![]() |
提出日時 | 2021-12-20 15:04:23 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,306 ms / 3,000 ms |
コード長 | 2,123 bytes |
コンパイル時間 | 189 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 147,032 KB |
最終ジャッジ日時 | 2024-09-15 15:19:19 |
合計ジャッジ時間 | 21,854 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 19 |
ソースコード
from collections import defaultdictclass UnionFind():def __init__(self, n):self.n = nself.parents = [-1] * ndef find(self, x):if self.parents[x] < 0:return xelse: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:returnif self.parents[x] > self.parents[y]:x, y = y, xself.parents[x] += self.parents[y]self.parents[y] = xdef 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_membersdef __str__(self):return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())N,M,Q = map(int,input().split())S = [[]]uf = UnionFind((N+1)*7)for i in range(1,N+1):S.append(list(input()))for j in range(7):if S[-1][j-1]=='1' and S[-1][j]=='1':uf.union(i*7+j%7,i*7+(j-1)%7)UV = [list(map(int,input().split())) for _ in range(M)]L = [[] for _ in range(N+1)]for u,v in UV:for i in range(7):if S[u][i]=='1' and S[v][i]=='1':uf.union(u*7+i,v*7+i)L[u].append(v)L[v].append(u)for _ in range(Q):q,x,y = map(int,input().split())y = (y-1)%7if q==1:S[x][y]='1'for j in range(7):if S[x][j-1]=='1' and S[x][j]=='1':uf.union(x*7+j%7,x*7+(j-1)%7)for l in L[x]:if S[l][y]=='1':uf.union(x*7+y,l*7+y)else:print(uf.size(x*7))