結果
問題 | No.2946 Puyo |
ユーザー | katonyonko |
提出日時 | 2024-10-25 21:34:56 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 322 ms / 2,000 ms |
コード長 | 2,553 bytes |
コンパイル時間 | 630 ms |
コンパイル使用メモリ | 82,164 KB |
実行使用メモリ | 119,248 KB |
最終ジャッジ日時 | 2024-10-25 21:35:08 |
合計ジャッジ時間 | 12,740 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 45 ms
56,692 KB |
testcase_01 | AC | 45 ms
56,104 KB |
testcase_02 | AC | 45 ms
56,756 KB |
testcase_03 | AC | 305 ms
118,892 KB |
testcase_04 | AC | 314 ms
118,924 KB |
testcase_05 | AC | 318 ms
119,248 KB |
testcase_06 | AC | 309 ms
118,904 KB |
testcase_07 | AC | 322 ms
118,020 KB |
testcase_08 | AC | 103 ms
77,172 KB |
testcase_09 | AC | 181 ms
92,608 KB |
testcase_10 | AC | 108 ms
77,244 KB |
testcase_11 | AC | 196 ms
93,964 KB |
testcase_12 | AC | 99 ms
76,952 KB |
testcase_13 | AC | 53 ms
64,780 KB |
testcase_14 | AC | 134 ms
81,336 KB |
testcase_15 | AC | 109 ms
77,032 KB |
testcase_16 | AC | 143 ms
77,888 KB |
testcase_17 | AC | 251 ms
100,216 KB |
testcase_18 | AC | 90 ms
76,304 KB |
testcase_19 | AC | 173 ms
78,932 KB |
testcase_20 | AC | 191 ms
79,860 KB |
testcase_21 | AC | 239 ms
88,400 KB |
testcase_22 | AC | 141 ms
76,968 KB |
testcase_23 | AC | 189 ms
84,888 KB |
testcase_24 | AC | 287 ms
85,984 KB |
testcase_25 | AC | 256 ms
83,304 KB |
testcase_26 | AC | 280 ms
93,680 KB |
testcase_27 | AC | 100 ms
76,636 KB |
testcase_28 | AC | 212 ms
81,308 KB |
testcase_29 | AC | 255 ms
83,588 KB |
testcase_30 | AC | 195 ms
82,864 KB |
testcase_31 | AC | 240 ms
86,564 KB |
testcase_32 | AC | 264 ms
85,520 KB |
testcase_33 | AC | 209 ms
81,200 KB |
testcase_34 | AC | 280 ms
86,828 KB |
testcase_35 | AC | 242 ms
83,548 KB |
testcase_36 | AC | 235 ms
83,048 KB |
testcase_37 | AC | 277 ms
83,296 KB |
testcase_38 | AC | 220 ms
81,536 KB |
testcase_39 | AC | 210 ms
92,140 KB |
testcase_40 | AC | 184 ms
88,376 KB |
testcase_41 | AC | 261 ms
92,040 KB |
testcase_42 | AC | 267 ms
89,912 KB |
testcase_43 | AC | 211 ms
83,372 KB |
testcase_44 | AC | 231 ms
82,016 KB |
testcase_45 | AC | 205 ms
81,764 KB |
testcase_46 | AC | 172 ms
79,632 KB |
testcase_47 | AC | 239 ms
82,988 KB |
ソースコード
import io import sys from collections import defaultdict, deque, Counter from itertools import permutations, combinations, accumulate from heapq import heappush, heappop from bisect import bisect_right, bisect_left from math import gcd import math _INPUT = """\ 6 4 4 AAAA ABCB ADDA AEEE 1 1 . 3 3 ABB A.B AAB """ 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 union(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): return {r: self.members(r) for r in self.roots()} def __str__(self): return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots()) def input(): return sys.stdin.readline()[:-1] def solve(test): H,W=map(int, input().split()) G=[input() for _ in range(H)] uf=UnionFind(H*W) for i in range(H): for j in range(W): for dx,dy in [(1,0),(0,1),(-1,0),(0,-1)]: nx,ny=i+dx,j+dy if 0<=nx<H and 0<=ny<W and G[i][j]==G[nx][ny]: uf.union(i*W+j,nx*W+ny) ans=[[G[i][j] if uf.size(i*W+j)<4 else '.' for j in range(W)] for i in range(H)] for i in range(H): print("".join(ans[i])) def random_input(): from random import randint,shuffle N=randint(1,10) M=randint(1,N) A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)] shuffle(A) return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3 def simple_solve(): return [] def main(test): if test==0: solve(0) elif test==1: sys.stdin = io.StringIO(_INPUT) case_no=int(input()) for _ in range(case_no): solve(0) else: for i in range(1000): sys.stdin = io.StringIO(random_input()) x=solve(1) y=simple_solve() if x!=y: print(i,x,y) print(*[line for line in sys.stdin],sep='') break #0:提出用、1:与えられたテスト用、2:ストレステスト用 main(0)