結果
問題 | No.2946 Puyo |
ユーザー |
|
提出日時 | 2024-10-25 21:23:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 522 ms / 2,000 ms |
コード長 | 2,687 bytes |
コンパイル時間 | 349 ms |
コンパイル使用メモリ | 82,284 KB |
実行使用メモリ | 269,016 KB |
最終ジャッジ日時 | 2024-10-25 21:23:35 |
合計ジャッジ時間 | 16,348 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 45 |
ソースコード
# import pypyjit# pypyjit.set_param('max_unroll_recursion=-1')from collections import defaultdict as ddS = inputR = rangeP = printdef I(): return int(S())def M(): return map(int, S().split())def L(): return list(M())def O(): return list(map(int, open(0).read().split()))def yn(b): print("Yes" if b else "No")biga = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"smaa = "abcdefghijklmnopqrstuvwxyz"ctoi = lambda c: ord(c) - ord('a')itoc = lambda i: chr(ord('a') + i)inf = 10 ** 18mod = 998244353def acc(a):b = [0]for i in a:b.append(b[-1] + i)return bimport typingclass DSU:'''Implement (union by size) + (path halving)Reference:Zvi Galil and Giuseppe F. Italiano,Data structures and algorithms for disjoint set union problems'''def __init__(self, n: int = 0) -> None:self._n = nself.parent_or_size = [-1] * ndef merge(self, a: int, b: int) -> int:assert 0 <= a < self._nassert 0 <= b < self._nx = self.leader(a)y = self.leader(b)if x == y:return xif -self.parent_or_size[x] < -self.parent_or_size[y]:x, y = y, xself.parent_or_size[x] += self.parent_or_size[y]self.parent_or_size[y] = xreturn xdef same(self, a: int, b: int) -> bool:assert 0 <= a < self._nassert 0 <= b < self._nreturn self.leader(a) == self.leader(b)def leader(self, a: int) -> int:assert 0 <= a < self._nparent = self.parent_or_size[a]while parent >= 0:if self.parent_or_size[parent] < 0:return parentself.parent_or_size[a], a, parent = (self.parent_or_size[parent],self.parent_or_size[parent],self.parent_or_size[self.parent_or_size[parent]])return adef size(self, a: int) -> int:assert 0 <= a < self._nreturn -self.parent_or_size[self.leader(a)]def groups(self) -> typing.List[typing.List[int]]:leader_buf = [self.leader(i) for i in range(self._n)]result: typing.List[typing.List[int]] = [[] for _ in range(self._n)]for i in range(self._n):result[leader_buf[i]].append(i)return list(filter(lambda r: r, result))H, W = map(int, input().split())G = [list(input()) for _ in R(H)]uf = DSU(H * W)for i in R(H):for j in R(W - 1):if G[i][j]==G[i][j+1]:uf.merge(i*W+j,i*W+j+1)for i in R(H-1):for j in R(W):if G[i][j]==G[i+1][j]:uf.merge(i*W+j,i*W+W+j)for i in uf.groups():if len(i)>=4:for j in i:G[j//W][j%W]='.'for i in G:P(''.join(i))