結果
| 問題 | No.2657 Falling Block Game |
| コンテスト | |
| ユーザー |
 detteiuu
|
| 提出日時 | 2026-07-12 05:26:01 |
| 言語 | PyPy3 (7.3.17) |
| 結果 |
AC
|
| 実行時間 | 530 ms / 2,000 ms |
| + 715µs | |
| コード長 | 6,261 bytes |
| 記録 | |
| コンパイル時間 | 517 ms |
| コンパイル使用メモリ | 95,848 KB |
| 実行使用メモリ | 165,648 KB |
| 最終ジャッジ日時 | 2026-07-12 11:55:12 |
| 合計ジャッジ時間 | 19,595 ms |
|
ジャッジサーバーID （参考情報） |
judge1_1 / judge3_0 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 37 |
ソースコード
from sys import stdin
input = stdin.readline
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py
import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, List, Tuple, TypeVar, Optional
T = TypeVar('T')
class SortedMultiset(Generic[T]):
BUCKET_RATIO = 16
SPLIT_RATIO = 24
def __init__(self, a: Iterable[T] = []) -> None:
"Make a new SortedMultiset from iterable. / O(N) if sorted / O(N log N)"
a = list(a)
n = self.size = len(a)
if any(a[i] > a[i + 1] for i in range(n - 1)):
a.sort()
num_bucket = int(math.ceil(math.sqrt(n / self.BUCKET_RATIO)))
self.a = [a[n * i // num_bucket : n * (i + 1) // num_bucket] for i in range(num_bucket)]
def __iter__(self) -> Iterator[T]:
for i in self.a:
for j in i: yield j
def __reversed__(self) -> Iterator[T]:
for i in reversed(self.a):
for j in reversed(i): yield j
def __eq__(self, other) -> bool:
return list(self) == list(other)
def __len__(self) -> int:
return self.size
def __repr__(self) -> str:
return "SortedMultiset" + str(self.a)
def __str__(self) -> str:
s = str(list(self))
return "{" + s[1 : len(s) - 1] + "}"
def _position(self, x: T) -> Tuple[List[T], int, int]:
"return the bucket, index of the bucket and position in which x should be. self must not be empty."
for i, a in enumerate(self.a):
if x <= a[-1]: break
return (a, i, bisect_left(a, x))
def __contains__(self, x: T) -> bool:
if self.size == 0: return False
a, _, i = self._position(x)
return i != len(a) and a[i] == x
def count(self, x: T) -> int:
"Count the number of x."
return self.index_right(x) - self.index(x)
def add(self, x: T) -> None:
"Add an element. / O(√N)"
if self.size == 0:
self.a = [[x]]
self.size = 1
return
a, b, i = self._position(x)
a.insert(i, x)
self.size += 1
if len(a) > len(self.a) * self.SPLIT_RATIO:
mid = len(a) >> 1
self.a[b:b+1] = [a[:mid], a[mid:]]
def _pop(self, a: List[T], b: int, i: int) -> T:
ans = a.pop(i)
self.size -= 1
if not a: del self.a[b]
return ans
def discard(self, x: T) -> bool:
"Remove an element and return True if removed. / O(√N)"
if self.size == 0: return False
a, b, i = self._position(x)
if i == len(a) or a[i] != x: return False
self._pop(a, b, i)
return True
def lt(self, x: T) -> Optional[T]:
"Find the largest element < x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] < x:
return a[bisect_left(a, x) - 1]
def le(self, x: T) -> Optional[T]:
"Find the largest element <= x, or None if it doesn't exist."
for a in reversed(self.a):
if a[0] <= x:
return a[bisect_right(a, x) - 1]
def gt(self, x: T) -> Optional[T]:
"Find the smallest element > x, or None if it doesn't exist."
for a in self.a:
if a[-1] > x:
return a[bisect_right(a, x)]
def ge(self, x: T) -> Optional[T]:
"Find the smallest element >= x, or None if it doesn't exist."
for a in self.a:
if a[-1] >= x:
return a[bisect_left(a, x)]
def __getitem__(self, i: int) -> T:
"Return the i-th element."
if i < 0:
for a in reversed(self.a):
i += len(a)
if i >= 0: return a[i]
else:
for a in self.a:
if i < len(a): return a[i]
i -= len(a)
raise IndexError
def pop(self, i: int = -1) -> T:
"Pop and return the i-th element."
if i < 0:
for b, a in enumerate(reversed(self.a)):
i += len(a)
if i >= 0: return self._pop(a, ~b, i)
else:
for b, a in enumerate(self.a):
if i < len(a): return self._pop(a, b, i)
i -= len(a)
raise IndexError
def index(self, x: T) -> int:
"Count the number of elements < x."
ans = 0
for a in self.a:
if a[-1] >= x:
return ans + bisect_left(a, x)
ans += len(a)
return ans
def index_right(self, x: T) -> int:
"Count the number of elements <= x."
ans = 0
for a in self.a:
if a[-1] > x:
return ans + bisect_right(a, x)
ans += len(a)
return ans
INF = 1<<60
H, W = map(int, input().split())
S = [input().rstrip("\n") for _ in range(H)]
dp = [0]*W
for i in reversed(range(H-1)):
A = [-1]
for j in range(W):
if S[i][j] == "#":
A.append(j)
else:
A.append(A[-1])
A = A[1:]
B = [W]
for j in reversed(range(W)):
if S[i][j] == "#":
B.append(j)
else:
B.append(B[-1])
B = B[::-1][:-1]
ndp = [INF]*W
L, R = [], []
for j in range(W):
if S[i][j] == ".":
L.append((max(j-dp[j], A[j]+1), dp[j]))
R.append((min(j+dp[j]+1, B[j]), dp[j]))
L.sort(key=lambda x:x[0])
R.sort(key=lambda x:x[0])
SM = SortedMultiset()
idxL, idxR = 0, 0
for j in range(W):
while idxL < len(L) and L[idxL][0] <= j:
SM.add(L[idxL][1])
idxL += 1
while idxR < len(R) and R[idxR][0] <= j:
SM.discard(R[idxR][1])
idxR += 1
if S[i][j] != "#" and 1 <= len(SM):
ndp[j] = SM[0]
L = [INF]
for j in range(W):
if S[i][j] != "#":
L.append(min(L[-1]+1, ndp[j]))
else:
L.append(INF)
L = L[1:]
R = [INF]
for j in reversed(range(W)):
if S[i][j] != "#":
R.append(min(R[-1]+1, ndp[j]))
else:
R.append(INF)
R = R[::-1][:-1]
for j in range(W):
ndp[j] = min(ndp[j], L[j], R[j])
dp = ndp
print(*dp, sep="\n")