結果
問題 | No.2456 Stamp Art |
ユーザー | mkawa2 |
提出日時 | 2023-09-09 09:32:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,276 ms / 5,000 ms |
コード長 | 2,760 bytes |
コンパイル時間 | 1,172 ms |
コンパイル使用メモリ | 86,244 KB |
実行使用メモリ | 415,984 KB |
最終ジャッジ日時 | 2023-09-09 09:32:55 |
合計ジャッジ時間 | 32,421 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
71,380 KB |
testcase_01 | AC | 75 ms
71,172 KB |
testcase_02 | AC | 73 ms
71,156 KB |
testcase_03 | AC | 1,847 ms
412,460 KB |
testcase_04 | AC | 84 ms
70,952 KB |
testcase_05 | AC | 89 ms
76,388 KB |
testcase_06 | AC | 1,638 ms
406,112 KB |
testcase_07 | AC | 1,410 ms
361,216 KB |
testcase_08 | AC | 1,250 ms
407,520 KB |
testcase_09 | AC | 1,584 ms
402,200 KB |
testcase_10 | AC | 2,229 ms
404,668 KB |
testcase_11 | AC | 1,421 ms
401,976 KB |
testcase_12 | AC | 1,553 ms
360,588 KB |
testcase_13 | AC | 2,276 ms
406,792 KB |
testcase_14 | AC | 2,233 ms
407,652 KB |
testcase_15 | AC | 1,325 ms
415,984 KB |
testcase_16 | AC | 1,045 ms
249,008 KB |
testcase_17 | AC | 87 ms
76,016 KB |
testcase_18 | AC | 78 ms
75,988 KB |
testcase_19 | AC | 938 ms
324,780 KB |
testcase_20 | AC | 1,883 ms
383,228 KB |
testcase_21 | AC | 1,767 ms
398,508 KB |
testcase_22 | AC | 1,888 ms
402,112 KB |
testcase_23 | AC | 178 ms
94,884 KB |
testcase_24 | AC | 292 ms
106,952 KB |
testcase_25 | AC | 72 ms
71,388 KB |
ソースコード
import sys # sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(1000005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = -1-(-1 << 63) # md = 10**9+7 md = 998244353 class CumSum2D: def __init__(self, arr, w=None): if w: self.h = arr self.w = w else: self.h = len(arr) self.w = len(arr[0]) self.t = [0]*(self.h+1)*(self.w+1) if w == None: w = self.w+1 for i, row in enumerate(arr): self.t[(i+1)*w+1:(i+1)*w+w] = row self._finalized = False def add(self, i, j, c): w = self.w+1 self.t[(i+1)*w+j+1] += c def finalize(self): w = self.w+1 self._finalized = True for ij in range(w+1, (self.h+1)*w): i, j = divmod(ij, w) if j == 0: continue if j+1 < w: self.t[i*w+j+1] += self.t[i*w+j] self.t[i*w+j] += self.t[(i-1)*w+j] def sum(self, ij0, ij1=None): if not self._finalized: print("Finalize!!!") exit() w = self.w+1 i, j = ij0 x, y = self.h, self.w if ij1: x, y = ij1 if i >= x or j >= y: return 0 return self.t[i*w+j]+self.t[x*w+y]-self.t[i*w+y]-self.t[x*w+j] def binary_search(l, r, minimize): if minimize: l -= 1 else: r += 1 while l+1 < r: m = (l+r)//2 if ok(m) ^ minimize: l = m else: r = m if minimize: return r return l def ok(m): m2=m**2 imos=[[0]*(w+1) for _ in range(h+1)] for i in range(h-m+1): for j in range(w-m+1): if cs.sum([i,j],[i+m,j+m])==m2: imos[i][j]+=1 imos[i+m][j+m]+=1 imos[i+m][j]-=1 imos[i][j+m]-=1 for i in range(h): for j in range(w): imos[i][j+1]+=imos[i][j] for i in range(h): for j in range(w): imos[i+1][j]+=imos[i][j] if (imos[i][j]>0)!=(ss[i][j]>0):return False return True h,w=LI() ss=[[(c=="#")*1 for c in SI()] for _ in range(h)] cs=CumSum2D(ss) cs.finalize() tt=[] for s in ss:tt+=s+[0] print(binary_search(1,min(h,w),False))