Submission #3228762
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 + k) % N][i]: f = False break if not f: break if f: ans += N print(ans)
Submission Info
Submission Time | |
---|---|
Task | B - Find Symmetries |
User | poina |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 338 Byte |
Status | WA |
Exec Time | 2104 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | 17 ms | 3060 KB |
sample_02.txt | AC | 17 ms | 2940 KB |
sample_03.txt | AC | 17 ms | 3060 KB |
subtask_1_01.txt | WA | 17 ms | 3060 KB |
subtask_1_02.txt | AC | 17 ms | 2940 KB |
subtask_1_03.txt | AC | 18 ms | 3060 KB |
subtask_1_04.txt | AC | 18 ms | 3060 KB |
subtask_1_05.txt | TLE | 2104 ms | 3060 KB |
subtask_1_06.txt | WA | 1185 ms | 3060 KB |
subtask_1_07.txt | WA | 17 ms | 3060 KB |
subtask_1_08.txt | TLE | 2103 ms | 3060 KB |
subtask_1_09.txt | TLE | 2104 ms | 3064 KB |
subtask_1_10.txt | TLE | 2104 ms | 3060 KB |
subtask_1_11.txt | WA | 342 ms | 3060 KB |
subtask_1_12.txt | AC | 1940 ms | 3060 KB |
subtask_1_13.txt | WA | 1933 ms | 3060 KB |
subtask_1_14.txt | WA | 1666 ms | 3060 KB |
subtask_1_15.txt | WA | 18 ms | 3060 KB |
subtask_1_16.txt | WA | 1290 ms | 3060 KB |
subtask_1_17.txt | AC | 378 ms | 3060 KB |
subtask_1_18.txt | AC | 107 ms | 3060 KB |
subtask_1_19.txt | TLE | 2104 ms | 3060 KB |
subtask_1_20.txt | WA | 18 ms | 3060 KB |
subtask_1_21.txt | WA | 18 ms | 3060 KB |
subtask_1_22.txt | WA | 18 ms | 3060 KB |
subtask_1_23.txt | WA | 18 ms | 3060 KB |
subtask_1_24.txt | TLE | 2103 ms | 3060 KB |
subtask_1_25.txt | WA | 18 ms | 3060 KB |
subtask_1_26.txt | WA | 18 ms | 3060 KB |
subtask_1_27.txt | TLE | 2104 ms | 3060 KB |
subtask_1_28.txt | TLE | 2103 ms | 3060 KB |
subtask_1_29.txt | TLE | 2104 ms | 3060 KB |
subtask_1_30.txt | TLE | 2104 ms | 3060 KB |