Submission #27597329
Source Code Expand
Copy
#include <bits/stdc++.h>using namespace std;int main(){int N;cin >> N;vector<string>S(N);for(int i = 0; i < N; i++) cin >> S[i];int ans = 0;for(int i = 0; i < N; i++){bool flag = true;for(int y = 0; y < N; y++){for(int x = 0; x < N; x++){if(S[(y + i) % N][x] != S[(x + i) % N][y]) flag = false;}}if(flag) ans += N;}cout << ans << endl;return 0;
#include <bits/stdc++.h> using namespace std; int main(){ int N; cin >> N; vector<string>S(N); for(int i = 0; i < N; i++) cin >> S[i]; int ans = 0; for(int i = 0; i < N; i++){ bool flag = true; for(int y = 0; y < N; y++){ for(int x = 0; x < N; x++){ if(S[(y + i) % N][x] != S[(x + i) % N][y]) flag = false; } } if(flag) ans += N; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Find Symmetries |
User | macle |
Language | C++ (GCC 9.2.1) |
Score | 500 |
Code Size | 495 Byte |
Status | AC |
Exec Time | 93 ms |
Memory | 3760 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 | 9 ms | 3472 KB |
sample_02.txt | AC | 2 ms | 3472 KB |
sample_03.txt | AC | 3 ms | 3472 KB |
subtask_1_01.txt | AC | 2 ms | 3536 KB |
subtask_1_02.txt | AC | 2 ms | 3536 KB |
subtask_1_03.txt | AC | 87 ms | 3624 KB |
subtask_1_04.txt | AC | 73 ms | 3680 KB |
subtask_1_05.txt | AC | 59 ms | 3608 KB |
subtask_1_06.txt | AC | 42 ms | 3544 KB |
subtask_1_07.txt | AC | 59 ms | 3520 KB |
subtask_1_08.txt | AC | 82 ms | 3708 KB |
subtask_1_09.txt | AC | 90 ms | 3628 KB |
subtask_1_10.txt | AC | 92 ms | 3624 KB |
subtask_1_11.txt | AC | 92 ms | 3624 KB |
subtask_1_12.txt | AC | 89 ms | 3756 KB |
subtask_1_13.txt | AC | 89 ms | 3700 KB |
subtask_1_14.txt | AC | 91 ms | 3636 KB |
subtask_1_15.txt | AC | 89 ms | 3600 KB |
subtask_1_16.txt | AC | 93 ms | 3624 KB |
subtask_1_17.txt | AC | 93 ms | 3696 KB |
subtask_1_18.txt | AC | 90 ms | 3632 KB |
subtask_1_19.txt | AC | 92 ms | 3636 KB |
subtask_1_20.txt | AC | 90 ms | 3640 KB |
subtask_1_21.txt | AC | 89 ms | 3600 KB |
subtask_1_22.txt | AC | 90 ms | 3760 KB |
subtask_1_23.txt | AC | 90 ms | 3692 KB |
subtask_1_24.txt | AC | 89 ms | 3640 KB |
subtask_1_25.txt | AC | 90 ms | 3636 KB |
subtask_1_26.txt | AC | 91 ms | 3560 KB |
subtask_1_27.txt | AC | 89 ms | 3756 KB |
subtask_1_28.txt | AC | 91 ms | 3688 KB |
subtask_1_29.txt | AC | 92 ms | 3612 KB |
subtask_1_30.txt | AC | 90 ms | 3704 KB |