結果

問題 No.2641 draw X
ユーザー mkawa2mkawa2
提出日時 2024-02-19 23:28:25
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 880 ms / 2,000 ms
コード長 2,072 bytes
コンパイル時間 184 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 200,348 KB
最終ジャッジ日時 2024-02-19 23:28:41
合計ジャッジ時間 14,578 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge16
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
55,732 KB
testcase_01 AC 40 ms
55,732 KB
testcase_02 AC 42 ms
55,732 KB
testcase_03 AC 39 ms
55,732 KB
testcase_04 AC 40 ms
55,732 KB
testcase_05 AC 40 ms
55,732 KB
testcase_06 AC 40 ms
55,732 KB
testcase_07 AC 39 ms
55,732 KB
testcase_08 AC 40 ms
55,732 KB
testcase_09 AC 40 ms
55,732 KB
testcase_10 AC 41 ms
55,732 KB
testcase_11 AC 39 ms
55,732 KB
testcase_12 AC 40 ms
55,732 KB
testcase_13 AC 41 ms
55,732 KB
testcase_14 AC 39 ms
55,732 KB
testcase_15 AC 519 ms
133,404 KB
testcase_16 AC 784 ms
200,348 KB
testcase_17 AC 41 ms
55,732 KB
testcase_18 AC 40 ms
55,732 KB
testcase_19 AC 41 ms
55,732 KB
testcase_20 AC 184 ms
84,812 KB
testcase_21 AC 220 ms
90,180 KB
testcase_22 AC 185 ms
85,276 KB
testcase_23 AC 190 ms
87,484 KB
testcase_24 AC 129 ms
79,564 KB
testcase_25 AC 136 ms
80,452 KB
testcase_26 AC 236 ms
92,604 KB
testcase_27 AC 167 ms
82,396 KB
testcase_28 AC 297 ms
104,172 KB
testcase_29 AC 453 ms
112,544 KB
testcase_30 AC 444 ms
115,232 KB
testcase_31 AC 382 ms
112,744 KB
testcase_32 AC 571 ms
135,200 KB
testcase_33 AC 692 ms
170,144 KB
testcase_34 AC 469 ms
132,716 KB
testcase_35 AC 412 ms
123,168 KB
testcase_36 AC 659 ms
145,820 KB
testcase_37 AC 827 ms
187,164 KB
testcase_38 AC 672 ms
152,732 KB
testcase_39 AC 735 ms
161,820 KB
testcase_40 AC 880 ms
186,140 KB
testcase_41 AC 612 ms
140,060 KB
testcase_42 AC 690 ms
158,108 KB
testcase_43 AC 713 ms
155,804 KB
権限があれば一括ダウンロードができます

ソースコード

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][j+k+1]-=1
            y[i-k][j+k]+=1
            y[i+k+1][j-k-1]-=1
            # pDB(i,j,k)
            # p2D(x)
            # p2D(y)
for i in range(h):
    for j in range(w):
        x[i+1][j+1]+=x[i][j]
        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