結果

問題 No.2692 How Many Times Reached?
ユーザー FromBooskaFromBooska
提出日時 2024-03-22 22:58:56
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 54 ms / 2,000 ms
コード長 1,249 bytes
コンパイル時間 258 ms
コンパイル使用メモリ 81,712 KB
実行使用メモリ 63,252 KB
最終ジャッジ日時 2024-09-30 12:20:41
合計ジャッジ時間 3,431 ms
ジャッジサーバーID
(参考情報)
judge3 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# AB
N = int(input())
S = []
for i in range(N):
S.append(input())
A_row = [0]*N
A_col = [0]*N
#B_row = [0]*N
#B_col = [0]*N
for i in range(N):
for j in range(N):
if S[i][j] == 'A':
A_row[i] += 1
A_col[j] += 1
#elif S[i][j] == 'B':
# B_row[i] += 1
# B_col[j] += 1
ans = 0
for i in range(N):
for j in range(N):
if S[i][j] == '.':
if A_row[i]==N-1:
ans += 1
if A_col[j]==N-1:
ans += 1
#
# \
count_A = 0
dot_count = 0
for i in range(N):
if S[i][i] == 'A':
count_A += 1
elif S[i][i] == '.':
dot_count += 1
#print('count_A', count_A, 'dot_count', dot_count)
if count_A == N-1 and dot_count == 1:
ans += 1
# /
count_A = 0
dot_count = 0
for i in range(N):
if S[i][N-1-i] == 'A':
count_A += 1
elif S[i][N-1-i] == '.':
dot_count += 1
#print('count_A', count_A, 'dot_count', dot_count)
if count_A == N-1 and dot_count == 1:
ans += 1
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0