結果

問題 No.2412 YOU Grow Bigger!
ユーザー sotanishy
提出日時 2023-08-11 23:24:58
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 116 ms / 6,000 ms
コード長 1,795 bytes
コンパイル時間 225 ms
コンパイル使用メモリ 82,020 KB
実行使用メモリ 77,260 KB
最終ジャッジ日時 2024-11-21 08:45:21
合計ジャッジ時間 3,255 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 29
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import sys
input = sys.stdin.readline
H, W = map(int, input().split())
S = [input().rstrip() for _ in range(H)]
reachable1 = [[0] * W for _ in range(H)]
st = []
for i in range(H):
for j in range(W):
if S[i][j] == '#' and (i >= H-3 or j < 3):
reachable1[i][j] = 1
st.append((i, j))
while st:
i, j = st.pop()
for ni in range(i-3, i+4):
for nj in range(j-3, j+4):
if abs(i-ni)+abs(j-nj) <= 5 and 0 <= ni < H and 0 <= nj < W and S[ni][nj] == '#' and not reachable1[ni][nj]:
reachable1[ni][nj] = 1
st.append((ni, nj))
reachable2 = [[0] * W for _ in range(H)]
st = []
for i in range(H):
for j in range(W):
if S[i][j] == '#' and (i < 3 or j >= W-3):
reachable2[i][j] = 1
st.append((i, j))
while st:
i, j = st.pop()
for ni in range(i-3, i+4):
for nj in range(j-3, j+4):
if abs(i-ni)+abs(j-nj) <= 5 and 0 <= ni < H and 0 <= nj < W and S[ni][nj] == '#' and not reachable2[ni][nj]:
reachable2[ni][nj] = 1
st.append((ni, nj))
for i in range(H):
for j in range(W):
if reachable1[i][j] and reachable2[i][j]:
print(0)
exit()
for i in range(H):
for j in range(W):
if (i < 3 and j < 3) or (i >= H-3 and j >= W-3):
continue
r1 = r2 = 0
if i >= H-3 or j < 3:
r1 = 1
if i < 3 or j >= W-3:
r2 = 1
for ni in range(i-3, i+4):
for nj in range(j-3, j+4):
if abs(i-ni)+abs(j-nj) <= 5 and 0 <= ni < H and 0 <= nj < W:
r1 |= reachable1[ni][nj]
r2 |= reachable2[ni][nj]
if r1 and r2:
print(1)
exit()
print(2)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0