結果
問題 | No.2692 How Many Times Reached? |
ユーザー | katonyonko |
提出日時 | 2024-03-22 21:28:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 49 ms / 2,000 ms |
コード長 | 1,702 bytes |
コンパイル時間 | 161 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 61,420 KB |
最終ジャッジ日時 | 2024-03-22 21:28:39 |
合計ジャッジ時間 | 3,577 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 43 ms
55,728 KB |
testcase_01 | AC | 42 ms
55,728 KB |
testcase_02 | AC | 42 ms
55,728 KB |
testcase_03 | AC | 49 ms
55,728 KB |
testcase_04 | AC | 43 ms
55,728 KB |
testcase_05 | AC | 42 ms
55,728 KB |
testcase_06 | AC | 42 ms
55,728 KB |
testcase_07 | AC | 43 ms
55,728 KB |
testcase_08 | AC | 42 ms
55,728 KB |
testcase_09 | AC | 43 ms
55,728 KB |
testcase_10 | AC | 43 ms
55,728 KB |
testcase_11 | AC | 43 ms
55,728 KB |
testcase_12 | AC | 43 ms
55,728 KB |
testcase_13 | AC | 42 ms
55,728 KB |
testcase_14 | AC | 43 ms
55,728 KB |
testcase_15 | AC | 43 ms
55,728 KB |
testcase_16 | AC | 43 ms
55,728 KB |
testcase_17 | AC | 42 ms
55,728 KB |
testcase_18 | AC | 44 ms
55,728 KB |
testcase_19 | AC | 43 ms
55,728 KB |
testcase_20 | AC | 42 ms
55,728 KB |
testcase_21 | AC | 43 ms
55,728 KB |
testcase_22 | AC | 43 ms
55,728 KB |
testcase_23 | AC | 42 ms
55,728 KB |
testcase_24 | AC | 43 ms
55,728 KB |
testcase_25 | AC | 42 ms
55,728 KB |
testcase_26 | AC | 43 ms
55,728 KB |
testcase_27 | AC | 42 ms
55,728 KB |
testcase_28 | AC | 42 ms
55,728 KB |
testcase_29 | AC | 43 ms
55,728 KB |
testcase_30 | AC | 43 ms
55,728 KB |
testcase_31 | AC | 43 ms
55,728 KB |
testcase_32 | AC | 43 ms
55,728 KB |
testcase_33 | AC | 43 ms
55,728 KB |
testcase_34 | AC | 48 ms
61,420 KB |
testcase_35 | AC | 46 ms
61,420 KB |
testcase_36 | AC | 46 ms
61,420 KB |
testcase_37 | AC | 47 ms
61,420 KB |
testcase_38 | AC | 46 ms
61,420 KB |
testcase_39 | AC | 48 ms
61,420 KB |
testcase_40 | AC | 46 ms
61,420 KB |
testcase_41 | AC | 46 ms
61,420 KB |
testcase_42 | AC | 48 ms
61,420 KB |
testcase_43 | AC | 47 ms
61,420 KB |
testcase_44 | AC | 46 ms
61,420 KB |
testcase_45 | AC | 42 ms
55,728 KB |
testcase_46 | AC | 45 ms
61,420 KB |
ソースコード
import io import sys from collections import defaultdict, deque, Counter from itertools import permutations, combinations, accumulate from heapq import heappush, heappop from bisect import bisect_right, bisect_left from math import gcd import math _INPUT = """\ 6 3 A.B AB. ... 3 AA. ABB .B. 3 BAB A.A BAB 6 AAAAA. BBBBB. AAAAA. BBBBB. AAAAA. BBBBB. """ def input(): return sys.stdin.readline()[:-1] def solve(test): N=int(input()) S=[input() for _ in range(N)] ans=0 for i in range(N): if S[i].count('A')==N-1 and S[i].count('.')==1: ans+=1 if ''.join([S[j][i] for j in range(N)]).count('A')==N-1 and ''.join([S[j][i] for j in range(N)]).count('.')==1: ans+=1 if ''.join([S[j][j] for j in range(N)]).count('A')==N-1 and ''.join([S[j][j] for j in range(N)]).count('.')==1: ans+=1 if ''.join([S[j][N-j-1] for j in range(N)]).count('A')==N-1 and ''.join([S[j][N-j-1] for j in range(N)]).count('.')==1: ans+=1 print(ans) def random_input(): from random import randint,shuffle N=randint(1,10) M=randint(1,N) A=list(range(1,M+1))+[randint(1,M) for _ in range(N-M)] shuffle(A) return (" ".join(map(str, [N,M]))+"\n"+" ".join(map(str, A))+"\n")*3 def simple_solve(): return [] def main(test): if test==0: solve(0) elif test==1: sys.stdin = io.StringIO(_INPUT) case_no=int(input()) for _ in range(case_no): solve(0) else: for i in range(1000): sys.stdin = io.StringIO(random_input()) x=solve(1) y=simple_solve() if x!=y: print(i,x,y) print(*[line for line in sys.stdin],sep='') break #0:提出用、1:与えられたテスト用、2:ストレステスト用 main(0)