結果

問題 No.2692 How Many Times Reached?
ユーザー flygonflygon
提出日時 2024-03-22 21:31:29
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 62 ms / 2,000 ms
コード長 892 bytes
コンパイル時間 546 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 67,584 KB
最終ジャッジ日時 2024-09-30 10:54:19
合計ジャッジ時間 3,496 ms
ジャッジサーバーID
(参考情報)
judge2 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 43
権限があれば一括ダウンロードができます

ソースコード

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

import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd
n = int(input())
s = [input().rstrip() for i in range(n)]
cnt = 0
for i in range(n):
tmp = 0
tmp2 = 0
for j in range(n):
tmp += s[i][j] == "A"
tmp2 += s[i][j] == "."
cnt += (tmp==(n-1)) & (tmp2 == 1)
for j in range(n):
tmp = 0
tmp2 = 0
for i in range(n):
tmp += s[i][j] == "A"
tmp2 += s[i][j] == "."
cnt += (tmp==(n-1)) & (tmp2 == 1)
tmp = 0
tmp2 = 0
for i in range(n):
tmp += s[i][i] == "A"
tmp2 += s[i][i] == "."
cnt += (tmp==(n-1)) & (tmp2 == 1)
tmp = 0
tmp2 = 0
for i in range(n):
tmp += s[i][n-i-1] == "A"
tmp2 += s[i][n-i-1] == "."
cnt += (tmp==(n-1)) & (tmp2 == 1)
print(cnt)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0