結果

問題 No.2641 draw X
ユーザー chineristACchineristAC
提出日時 2024-02-19 23:17:36
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 399 ms / 2,000 ms
コード長 3,157 bytes
コンパイル時間 156 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 94,716 KB
最終ジャッジ日時 2024-02-19 23:17:45
合計ジャッジ時間 8,233 ms
ジャッジサーバーID
（参考情報） 		judge16 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
58,324 KB
testcase_01 AC 38 ms
58,324 KB
testcase_02 AC 38 ms
58,324 KB
testcase_03 AC 38 ms
58,324 KB
testcase_04 AC 38 ms
58,324 KB
testcase_05 AC 39 ms
58,324 KB
testcase_06 AC 43 ms
58,324 KB
testcase_07 AC 40 ms
58,324 KB
testcase_08 AC 41 ms
58,324 KB
testcase_09 AC 39 ms
58,324 KB
testcase_10 AC 39 ms
58,324 KB
testcase_11 AC 39 ms
58,324 KB
testcase_12 AC 39 ms
58,324 KB
testcase_13 AC 38 ms
58,324 KB
testcase_14 AC 39 ms
58,324 KB
testcase_15 AC 246 ms
94,040 KB
testcase_16 AC 327 ms
94,716 KB
testcase_17 AC 43 ms
58,324 KB
testcase_18 AC 41 ms
58,324 KB
testcase_19 AC 42 ms
58,324 KB
testcase_20 AC 151 ms
79,020 KB
testcase_21 AC 176 ms
80,868 KB
testcase_22 AC 156 ms
79,352 KB
testcase_23 AC 164 ms
80,576 KB
testcase_24 AC 110 ms
78,252 KB
testcase_25 AC 122 ms
78,492 KB
testcase_26 AC 170 ms
80,944 KB
testcase_27 AC 152 ms
79,396 KB
testcase_28 AC 149 ms
83,756 KB
testcase_29 AC 205 ms
91,032 KB
testcase_30 AC 207 ms
88,868 KB
testcase_31 AC 205 ms
84,836 KB
testcase_32 AC 240 ms
90,308 KB
testcase_33 AC 262 ms
91,224 KB
testcase_34 AC 206 ms
85,144 KB
testcase_35 AC 192 ms
84,328 KB
testcase_36 AC 308 ms
92,984 KB
testcase_37 AC 383 ms
94,640 KB
testcase_38 AC 295 ms
92,420 KB
testcase_39 AC 328 ms
94,568 KB
testcase_40 AC 399 ms
93,852 KB
testcase_41 AC 265 ms
92,432 KB
testcase_42 AC 325 ms
92,928 KB
testcase_43 AC 301 ms
92,544 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys
from itertools import permutations
from heapq import heappop,heappush
from collections import deque
import random
import bisect

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

H,W = mi()
S = [input() for i in range(H)]

maximum_r = [[H+W]*W for i in range(H)]

for s in range(-(W-1),H):
    tmp = 0
    for j in range(max(0,-s),min(W,H-s)):
        i = s + j
        if not 0 <= i < H:
            continue

        if S[i][j] == "#":
            maximum_r[i][j] = min(maximum_r[i][j],tmp)
            tmp += 1
        else:
            maximum_r[i][j] = -1
            tmp = 0
    
    tmp = 0
    for j in range(max(0,-s),min(W,H-s))[::-1]:
        i = s + j
        if not 0 <= i < H:
            continue

        if S[i][j] == "#":
            maximum_r[i][j] = min(maximum_r[i][j],tmp)
            tmp += 1
        else:
            maximum_r[i][j] = -1
            tmp = 0


for t in range(H+W-1):
    tmp = 0
    """
    0 <= t-j < H
    t-H < j <= t
    max(0,t-H+1) <= j < min(t+1,W)
    """
    for j in range(max(0,t-H+1),min(t+1,W))[::-1]:
        i = t - j
        if not 0 <= i < H:
            continue

        if S[i][j] == "#":
            maximum_r[i][j] = min(maximum_r[i][j],tmp)
            tmp += 1
        else:
            maximum_r[i][j] = 0
            tmp = 0
    
    tmp = 0
    for j in range(max(0,t-H+1),min(t+1,W)):
        i = t - j
        if not 0 <= i < H:
            continue

        if S[i][j] == "#":
            maximum_r[i][j] = min(maximum_r[i][j],tmp)
            tmp += 1
        else:
            maximum_r[i][j] = -1
            tmp = 0

final = [[0]*W for i in range(H)]
for s in range(-(W-1),H):
    tmp = -1
    for j in range(max(0,-s),min(W,H-s)):
        i = s + j
        if not 0 <= i < H:
            continue
        
        if maximum_r[i][j] > 0:
            tmp = max(tmp-1,maximum_r[i][j])
        else:
            tmp = tmp - 1
        if tmp >= 0:
            final[i][j] = 1

    tmp = 0
    for j in range(max(0,-s),min(W,H-s))[::-1]:
        i = s + j
        if not 0 <= i < H:
            continue

        if maximum_r[i][j] > 0:
            tmp = max(tmp-1,maximum_r[i][j])
        else:
            tmp = tmp - 1
        if tmp >= 0:
            final[i][j] = 1

for t in range(H+W-1):
    tmp = 0
    for j in range(max(0,t-H+1),min(t+1,W))[::-1]:
        i = t - j
        if not 0 <= i < H:
            continue

        if maximum_r[i][j] > 0:
            tmp = max(tmp-1,maximum_r[i][j])
        else:
            tmp = tmp - 1
        if tmp >= 0:
            final[i][j] = 1
    
    tmp = 0
    for j in range(max(0,t-H+1),min(t+1,W)):
        i = t - j
        if not 0 <= i < H:
            continue

        if maximum_r[i][j] > 0:
            tmp = max(tmp-1,maximum_r[i][j])
        else:
            tmp = tmp - 1
        if tmp >= 0:
            final[i][j] = 1

#for i in range(H):
    #print(maximum_r[i])
#print()
#for i in range(H):
    #print(final[i])
ans = "Yes"
for i in range(H):
    for j in range(W):
        if S[i][j] == "#" and not final[i][j]:
            ans = "No"
print(ans)
0