結果
問題 | No.2692 How Many Times Reached? |
ユーザー | Barnard_Eagle |
提出日時 | 2024-03-22 23:10:12 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 1,030 bytes |
コンパイル時間 | 136 ms |
コンパイル使用メモリ | 11,904 KB |
実行使用メモリ | 10,240 KB |
最終ジャッジ日時 | 2024-03-22 23:10:19 |
合計ジャッジ時間 | 3,492 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 31 ms
9,984 KB |
testcase_01 | AC | 31 ms
9,984 KB |
testcase_02 | AC | 31 ms
9,984 KB |
testcase_03 | AC | 31 ms
9,984 KB |
testcase_04 | AC | 30 ms
9,984 KB |
testcase_05 | AC | 30 ms
9,984 KB |
testcase_06 | AC | 30 ms
9,984 KB |
testcase_07 | AC | 30 ms
9,984 KB |
testcase_08 | AC | 30 ms
9,984 KB |
testcase_09 | AC | 31 ms
9,984 KB |
testcase_10 | AC | 30 ms
9,984 KB |
testcase_11 | AC | 30 ms
9,984 KB |
testcase_12 | AC | 33 ms
9,984 KB |
testcase_13 | AC | 33 ms
9,984 KB |
testcase_14 | AC | 31 ms
9,984 KB |
testcase_15 | AC | 31 ms
9,984 KB |
testcase_16 | AC | 30 ms
9,984 KB |
testcase_17 | AC | 30 ms
9,984 KB |
testcase_18 | AC | 31 ms
9,984 KB |
testcase_19 | AC | 30 ms
9,984 KB |
testcase_20 | AC | 30 ms
9,984 KB |
testcase_21 | AC | 30 ms
9,984 KB |
testcase_22 | AC | 31 ms
9,984 KB |
testcase_23 | AC | 32 ms
9,984 KB |
testcase_24 | AC | 31 ms
9,984 KB |
testcase_25 | AC | 30 ms
9,984 KB |
testcase_26 | AC | 31 ms
9,984 KB |
testcase_27 | AC | 31 ms
9,984 KB |
testcase_28 | AC | 31 ms
9,984 KB |
testcase_29 | AC | 31 ms
9,984 KB |
testcase_30 | AC | 31 ms
9,984 KB |
testcase_31 | AC | 30 ms
9,984 KB |
testcase_32 | AC | 31 ms
9,984 KB |
testcase_33 | AC | 30 ms
9,984 KB |
testcase_34 | AC | 39 ms
10,240 KB |
testcase_35 | AC | 34 ms
10,112 KB |
testcase_36 | AC | 36 ms
10,112 KB |
testcase_37 | AC | 43 ms
10,240 KB |
testcase_38 | AC | 41 ms
10,240 KB |
testcase_39 | AC | 42 ms
10,240 KB |
testcase_40 | AC | 36 ms
10,112 KB |
testcase_41 | AC | 37 ms
10,112 KB |
testcase_42 | AC | 38 ms
10,112 KB |
testcase_43 | AC | 39 ms
10,112 KB |
testcase_44 | AC | 43 ms
10,240 KB |
testcase_45 | AC | 31 ms
9,984 KB |
testcase_46 | AC | 42 ms
10,240 KB |
ソースコード
n = int(input()) S = [list(input()) for _ in range(n)] #print(S) #print([r[0] for r in S]) ans = 0 #hoizon check for i in range(n): if "B" in S[i]: #print(S[i]) continue; count = S[i].count('.') #count = len([s for s in S[i] if "." in S[i]]) if count == 1: #print(S[i]) ans = ans+1 #vertical check for i in range(n): if "B" in [r[i] for r in S]: #print([r[i] for r in S]) continue; #print([r[i] for r in S]) VS=[r[i] for r in S] #print(VS) count = VS.count('.') #print(count) if count == 1: #print(S[i]) ans = ans+1 # naname rl_d = [[S[max(0, -d) + i][max(0, d) + i] for i in range(n - abs(d))] for d in range(1-n, n)] #print(rl_d[n-1]) if "B" in rl_d[n-1]: a=1 elif rl_d[n-1].count('.') == 1: ans = ans +1 lr_d = [[S[max(0, d) + i][min(n + d, n) - i - 1] for i in range(n - abs(d))] for d in range(1 - n, n)] #print(lr_d) if "B" in lr_d[n-1]: a=1 elif lr_d[n-1].count('.') == 1: ans = ans +1 print(ans)