Submission #3228788
Source Code Expand
N = int(input()) S = [input() for _ in range(N)] ans = 0 for k in range(N): f = True for i in range(N): for j in range(i + 1, N): if S[i][(j + k) % N] != S[j][(i + k) % N]: f = False break if not f: break if f: ans += N print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - Find Symmetries |
User | poina |
Language | PyPy3 (2.4.0) |
Score | 500 |
Code Size | 338 Byte |
Status | AC |
Exec Time | 655 ms |
Memory | 42480 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt, subtask_1_29.txt, subtask_1_30.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 159 ms | 38256 KB |
sample_02.txt | AC | 160 ms | 38256 KB |
sample_03.txt | AC | 159 ms | 38256 KB |
subtask_1_01.txt | AC | 160 ms | 38256 KB |
subtask_1_02.txt | AC | 160 ms | 38256 KB |
subtask_1_03.txt | AC | 170 ms | 38512 KB |
subtask_1_04.txt | AC | 168 ms | 38256 KB |
subtask_1_05.txt | AC | 246 ms | 42480 KB |
subtask_1_06.txt | AC | 324 ms | 41564 KB |
subtask_1_07.txt | AC | 174 ms | 39152 KB |
subtask_1_08.txt | AC | 589 ms | 41324 KB |
subtask_1_09.txt | AC | 655 ms | 41452 KB |
subtask_1_10.txt | AC | 418 ms | 41452 KB |
subtask_1_11.txt | AC | 403 ms | 41180 KB |
subtask_1_12.txt | AC | 304 ms | 41068 KB |
subtask_1_13.txt | AC | 286 ms | 41068 KB |
subtask_1_14.txt | AC | 471 ms | 41068 KB |
subtask_1_15.txt | AC | 177 ms | 39280 KB |
subtask_1_16.txt | AC | 287 ms | 41708 KB |
subtask_1_17.txt | AC | 205 ms | 39792 KB |
subtask_1_18.txt | AC | 185 ms | 39536 KB |
subtask_1_19.txt | AC | 472 ms | 41068 KB |
subtask_1_20.txt | AC | 177 ms | 39280 KB |
subtask_1_21.txt | AC | 276 ms | 41452 KB |
subtask_1_22.txt | AC | 263 ms | 41452 KB |
subtask_1_23.txt | AC | 415 ms | 41452 KB |
subtask_1_24.txt | AC | 647 ms | 41452 KB |
subtask_1_25.txt | AC | 262 ms | 41452 KB |
subtask_1_26.txt | AC | 299 ms | 41452 KB |
subtask_1_27.txt | AC | 653 ms | 41452 KB |
subtask_1_28.txt | AC | 646 ms | 41452 KB |
subtask_1_29.txt | AC | 412 ms | 41452 KB |
subtask_1_30.txt | AC | 418 ms | 41452 KB |