結果

問題 No.2641 draw X
ユーザー mkawa2mkawa2
提出日時 2024-02-19 23:16:49
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,034 bytes
コンパイル時間 241 ms
コンパイル使用メモリ 82,480 KB
実行使用メモリ 201,300 KB
最終ジャッジ日時 2024-09-29 02:58:02
合計ジャッジ時間 13,891 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 41 ms
54,748 KB
testcase_01 AC 41 ms
54,468 KB
testcase_02 AC 40 ms
54,972 KB
testcase_03 AC 41 ms
54,792 KB
testcase_04 AC 40 ms
55,188 KB
testcase_05 AC 40 ms
55,480 KB
testcase_06 AC 42 ms
54,568 KB
testcase_07 AC 41 ms
54,248 KB
testcase_08 WA -
testcase_09 AC 42 ms
55,792 KB
testcase_10 AC 42 ms
54,944 KB
testcase_11 AC 41 ms
55,240 KB
testcase_12 AC 41 ms
54,712 KB
testcase_13 AC 41 ms
53,920 KB
testcase_14 AC 40 ms
56,076 KB
testcase_15 AC 481 ms
133,876 KB
testcase_16 AC 749 ms
201,300 KB
testcase_17 AC 40 ms
55,304 KB
testcase_18 AC 39 ms
55,580 KB
testcase_19 AC 41 ms
55,284 KB
testcase_20 RE -
testcase_21 AC 217 ms
90,904 KB
testcase_22 RE -
testcase_23 RE -
testcase_24 RE -
testcase_25 RE -
testcase_26 WA -
testcase_27 RE -
testcase_28 AC 287 ms
104,256 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 AC 374 ms
113,184 KB
testcase_32 WA -
testcase_33 AC 669 ms
170,488 KB
testcase_34 AC 432 ms
133,356 KB
testcase_35 AC 400 ms
123,324 KB
testcase_36 WA -
testcase_37 RE -
testcase_38 RE -
testcase_39 RE -
testcase_40 WA -
testcase_41 RE -
testcase_42 AC 676 ms
158,772 KB
testcase_43 RE -
権限があれば一括ダウンロードができます

ソースコード

diff # 

import sys

# sys.setrecursionlimit(1000005)
# sys.set_int_max_str_digits(200005)
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 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from copy import deepcopy

h, w = LI()
ss = [[c == "#" for c in SI()] for _ in range(h)]

a = deepcopy(ss)
for i in range(h):
    for j in range(w):
        if i and j and a[i][j]: a[i][j] += a[i-1][j-1]

b = deepcopy(ss)
for i in range(h):
    for j in range(w):
        if i and j+1<w and b[i][j]: b[i][j] += b[i-1][j+1]

c = deepcopy(ss)
for i in range(h)[::-1]:
    for j in range(w):
        if i+1<h and j and c[i][j]: c[i][j] += c[i+1][j-1]

d = deepcopy(ss)
for i in range(h)[::-1]:
    for j in range(w):
        if i+1<h and j+1<w and d[i][j]: d[i][j] += d[i+1][j+1]

x=[[0]*(w+1) for _ in range(h+1)]
y=[[0]*(w+1) for _ in range(h+1)]
for i in range(h):
    for j in range(w):
        k=min(a[i][j],b[i][j],c[i][j],d[i][j])
        if k>1:
            k-=1
            x[i-k][j-k]+=1
            x[i+k+1][i+k+1]-=1
            y[i-k][j+k]+=1
            y[i+k+1][j-k-1]-=1
for i in range(h):
    for j in range(w):
        x[i+1][j+1]+=x[i][j]
    for j in range(w)[::-1]:
        y[i+1][j-1]+=y[i][j]

# p2D(x)
# p2D(y)

for i in range(h):
    for j in range(w):
        if ss[i][j]==0 and x[i][j]+y[i][j]>0:
            print("No")
            exit()
        if ss[i][j]>0 and x[i][j]+y[i][j]==0:
            print("No")
            exit()
print("Yes")
0