結果

問題 No.2641 draw X
ユーザー ニックネームニックネーム
提出日時 2024-02-19 22:39:53
言語 PyPy3
(7.3.15)
結果
WA  
実行時間 -
コード長 2,203 bytes
コンパイル時間 559 ms
コンパイル使用メモリ 81,700 KB
実行使用メモリ 217,604 KB
最終ジャッジ日時 2024-02-19 22:40:18
合計ジャッジ時間 16,886 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 36 ms
53,460 KB
testcase_01 AC 36 ms
53,460 KB
testcase_02 AC 36 ms
53,460 KB
testcase_03 AC 35 ms
53,460 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 36 ms
53,460 KB
testcase_09 AC 37 ms
53,460 KB
testcase_10 AC 37 ms
53,460 KB
testcase_11 AC 39 ms
53,460 KB
testcase_12 WA -
testcase_13 AC 37 ms
53,460 KB
testcase_14 AC 35 ms
53,460 KB
testcase_15 AC 402 ms
217,604 KB
testcase_16 AC 1,493 ms
211,784 KB
testcase_17 AC 35 ms
53,460 KB
testcase_18 AC 37 ms
53,460 KB
testcase_19 AC 37 ms
53,460 KB
testcase_20 AC 247 ms
86,932 KB
testcase_21 AC 276 ms
98,040 KB
testcase_22 AC 260 ms
86,568 KB
testcase_23 AC 231 ms
94,676 KB
testcase_24 AC 131 ms
84,212 KB
testcase_25 AC 136 ms
82,948 KB
testcase_26 AC 366 ms
98,820 KB
testcase_27 AC 220 ms
82,836 KB
testcase_28 AC 342 ms
125,108 KB
testcase_29 AC 384 ms
180,932 KB
testcase_30 AC 486 ms
163,728 KB
testcase_31 AC 528 ms
134,764 KB
testcase_32 AC 693 ms
181,776 KB
testcase_33 AC 1,208 ms
181,736 KB
testcase_34 AC 662 ms
140,252 KB
testcase_35 AC 789 ms
130,236 KB
testcase_36 AC 1,133 ms
197,380 KB
testcase_37 TLE -
testcase_38 AC 1,333 ms
195,400 KB
testcase_39 AC 1,456 ms
212,052 KB
testcase_40 TLE -
testcase_41 AC 914 ms
195,712 KB
testcase_42 AC 1,578 ms
196,184 KB
testcase_43 AC 1,486 ms
192,896 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(h):
    for j in range(w):
        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