結果
問題 | No.2641 draw X |
ユーザー | nikoro256 |
提出日時 | 2024-02-19 23:12:07 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,045 bytes |
コンパイル時間 | 148 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 109,484 KB |
最終ジャッジ日時 | 2024-02-19 23:12:21 |
合計ジャッジ時間 | 11,280 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
53,588 KB |
testcase_01 | AC | 39 ms
53,588 KB |
testcase_02 | AC | 38 ms
53,588 KB |
testcase_03 | AC | 35 ms
53,588 KB |
testcase_04 | AC | 34 ms
53,588 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 35 ms
53,588 KB |
testcase_08 | AC | 36 ms
53,588 KB |
testcase_09 | AC | 35 ms
53,588 KB |
testcase_10 | WA | - |
testcase_11 | AC | 35 ms
53,588 KB |
testcase_12 | AC | 36 ms
53,588 KB |
testcase_13 | AC | 38 ms
53,588 KB |
testcase_14 | AC | 36 ms
53,588 KB |
testcase_15 | AC | 128 ms
104,280 KB |
testcase_16 | AC | 826 ms
109,484 KB |
testcase_17 | AC | 35 ms
53,588 KB |
testcase_18 | AC | 36 ms
53,588 KB |
testcase_19 | AC | 36 ms
53,588 KB |
testcase_20 | AC | 162 ms
79,076 KB |
testcase_21 | AC | 151 ms
82,028 KB |
testcase_22 | AC | 166 ms
79,232 KB |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 101 ms
78,036 KB |
testcase_26 | WA | - |
testcase_27 | AC | 156 ms
78,300 KB |
testcase_28 | AC | 154 ms
88,336 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 191 ms
90,864 KB |
testcase_32 | WA | - |
testcase_33 | AC | 782 ms
102,952 KB |
testcase_34 | AC | 347 ms
92,160 KB |
testcase_35 | AC | 341 ms
89,496 KB |
testcase_36 | WA | - |
testcase_37 | AC | 1,168 ms
108,484 KB |
testcase_38 | AC | 382 ms
104,024 KB |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 464 ms
105,384 KB |
testcase_43 | WA | - |
ソースコード
H,W=map(int,input().split()) S=[] for _ in range(H): S.append(input()) down=[[0]*(W+1) for _ in range(H+1)] up=[[0]*(W+1) for _ in range(H+1)] for i in range(H): for j in range(W): if S[i][j]=='#': down[i][j]+=1 up[i][j]+=1 if i!=H-1 and j!=W-1 and S[i+1][j+1]=='#': down[i+1][j+1]+=down[i][j] if i!=H-1 and j!=0 and S[i+1][j-1]=='#': up[i+1][j-1]+=up[i][j] ansdown=[[0]*(W+1) for _ in range(H+1)] ansup=[[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]=='#' and S[i-1][j-1]=='#' and S[i-1][j+1]=='#' and S[i+1][j-1]=='#' and S[i+1][j+1]=='#': left,right=0,W//2+1 while right-left>1: mid=(right+left)//2 x=i+mid y=j+mid xs=i-mid-1 ys=j-mid-1 x2=i+mid y2=j-mid xs2=i-mid-1 ys2=j+mid+1 if 0<=x<H and 0<=y<W and 0<=xs+1<H and 0<=ys+1<W and down[x][y]-down[xs][ys]==mid*2+1: if 0<=x2<H and 0<=y2<W and 0<=xs2+1<H and 0<=ys2-1<W and up[x2][y2]-up[xs2][ys2]==mid*2+1: left=mid else: right=mid else: right=mid mid=left ansdown[i-mid][j-mid]+=1 ansdown[i+mid+1][j+mid+1]-=1 ansup[i-mid][j+mid]+=1 ansup[i+mid+1][j-mid-1]+=1 for i in range(H): for j in range(W): if i!=H-1 and j!=W-1 and S[i+1][j+1]=='#': ansdown[i+1][j+1]+=down[i][j] if i!=H-1 and j!=0 and S[i+1][j-1]=='#': ansup[i+1][j-1]+=up[i][j] flag=True for i in range(H): for j in range(W): if S[i][j]=='#': if ansdown[i][j]==0 and ansup[i][j]==0: flag=False #print(ansdown) #print(ansup) if flag: print('Yes') else: print('No')