結果

問題 No.2641 draw X
ユーザー ニックネームニックネーム
提出日時 2024-02-19 22:47:03
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,211 bytes
コンパイル時間 224 ms
コンパイル使用メモリ 82,504 KB
実行使用メモリ 219,684 KB
最終ジャッジ日時 2024-09-29 02:39:09
合計ジャッジ時間 21,718 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 32 ms
53,624 KB
testcase_01 AC 35 ms
53,152 KB
testcase_02 AC 36 ms
54,312 KB
testcase_03 AC 33 ms
53,812 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 36 ms
53,564 KB
testcase_09 AC 36 ms
54,076 KB
testcase_10 AC 35 ms
54,612 KB
testcase_11 AC 32 ms
54,352 KB
testcase_12 WA -
testcase_13 AC 32 ms
52,996 KB
testcase_14 AC 35 ms
53,496 KB
testcase_15 AC 344 ms
218,028 KB
testcase_16 AC 1,406 ms
219,684 KB
testcase_17 AC 34 ms
54,224 KB
testcase_18 AC 32 ms
52,748 KB
testcase_19 AC 32 ms
53,424 KB
testcase_20 AC 199 ms
87,316 KB
testcase_21 AC 256 ms
98,392 KB
testcase_22 AC 226 ms
86,440 KB
testcase_23 AC 209 ms
95,100 KB
testcase_24 AC 120 ms
84,872 KB
testcase_25 AC 127 ms
83,304 KB
testcase_26 AC 305 ms
99,260 KB
testcase_27 AC 194 ms
83,340 KB
testcase_28 AC 265 ms
125,544 KB
testcase_29 AC 349 ms
181,288 KB
testcase_30 AC 421 ms
167,876 KB
testcase_31 AC 413 ms
138,648 KB
testcase_32 AC 552 ms
181,820 KB
testcase_33 AC 910 ms
187,544 KB
testcase_34 AC 522 ms
140,364 KB
testcase_35 AC 538 ms
132,976 KB
testcase_36 AC 1,008 ms
197,908 KB
testcase_37 TLE -
testcase_38 AC 1,248 ms
196,280 KB
testcase_39 AC 1,314 ms
215,132 KB
testcase_40 TLE -
testcase_41 AC 860 ms
196,804 KB
testcase_42 AC 1,442 ms
197,100 KB
testcase_43 AC 1,366 ms
193,460 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

h,w = map(int,input().split())
s = [[v=="#" for v in input()] for _ in range(h)]
lurd = [t[:] for t in s]
for i in range(h-1):
    for j in range(w-1):
        lurd[i+1][j+1] += lurd[i][j]
rdlu = [t[:] for t in s]
for i in range(h-1,0,-1):
    for j in range(w-1,0,-1):
        rdlu[i-1][j-1] += rdlu[i][j]
ruld = [t[:] for t in s]
for i in range(h-1):
    for j in range(w-1,0,-1):
        ruld[i+1][j-1] += ruld[i][j]
ldru = [t[:] for t in s]
for i in range(h-1,0,-1):
    for j in range(w-1):
        ldru[i-1][j+1] += ldru[i][j]
p1 = [[0]*(w+1) for _ in range(h+1)]
p2 = [[0]*(w+1) for _ in range(h+1)]
p3 = [[0]*(w+1) for _ in range(h+1)]
p4 = [[0]*(w+1) for _ in range(h+1)]
for i in range(1,h-1):
    for j in range(1,w-1):
        if s[i][j]==0: continue
        ac1 = 0; wa = min(h-i,w-j)
        while wa-ac1>1:
            wj = (ac1+wa)//2
            if lurd[i+wj][j+wj]-lurd[i][j]==wj: ac1 = wj
            else: wa = wj
        ac2 = 0; wa = min(i+1,j+1)
        while wa-ac2>1:
            wj = (ac2+wa)//2
            if rdlu[i-wj][j-wj]-rdlu[i][j]==wj: ac2 = wj
            else: wa = wj
        ac3 = 0; wa = min(h-i,j+1)
        while wa-ac3>1:
            wj = (ac3+wa)//2
            if ruld[i+wj][j-wj]-ruld[i][j]==wj: ac3 = wj
            else: wa = wj
        ac4 = 0; wa = min(i+1,w-j)
        while wa-ac4>1:
            wj = (ac4+wa)//2
            if ldru[i-wj][j+wj]-ldru[i][j]==wj: ac4 = wj
            else: wa = wj
        m = min(ac1,ac2,ac3,ac4)
        if m==0: continue
        p1[i][j] += 1; p1[i+ac1+1][j+ac1+1] -= 1
        p2[i][j] += 1; p2[i-ac2-1][j-ac2-1] -= 1
        p3[i][j] += 1; p3[i+ac3+1][j-ac3-1] -= 1
        p4[i][j] += 1; p4[i-ac4-1][j+ac4+1] -= 1
for i in range(h):
    for j in range(w):
        p1[i+1][j+1] += p1[i][j]
for i in range(h-1,-1,-1):
    for j in range(w-1,-1,-1):
        p2[i-1][j-1] += p2[i][j]
for i in range(h):
    for j in range(w-1,-1,-1):
        p3[i+1][j-1] += p3[i][j]
for i in range(h-1,-1,-1):
    for j in range(w):
        p4[i-1][j+1] += p4[i][j]
t = [[False]*w for _ in range(h)]
for i in range(h):
    for j in range(w):
        t[i][j] = p1[i][j]>0 or p2[i][j]>0 or p3[i][j]>0 or p4[i][j]>0
print("Yes" if s==t else "No")
0