Submission #2851122
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long lli; typedef double lld; typedef vector<lli> vll; typedef vector<bool> vbl; typedef vector<double> vdl; typedef vector<string> mat; typedef vector<vdl> mad; typedef unordered_map<lli,unordered_map<lli,lli>> graph; typedef complex<double> cmp; typedef vector<cmp> vcl; lli n; mat s; lli ans = 0; bool check(){ for(lli i = 0;i < n;i++){ for(lli j = i+1;j < n;j++){ if(s[i][j] != s[j][i]) return false; } } return true; } int main(){ cin >> n; s = mat(n); for(lli i = 0;i < n;i++) cin >> s[i]; for(lli a = 0;a < n;a++){ for(lli i = 0;i < n;i++) rotate(s[i].begin(),s[i].begin()+1,s[i].end()); if(check()){ ans += n; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Find Symmetries |
User | deoxy |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 799 Byte |
Status | AC |
Exec Time | 32 ms |
Memory | 384 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 | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 1 ms | 256 KB |
subtask_1_02.txt | AC | 1 ms | 256 KB |
subtask_1_03.txt | AC | 5 ms | 384 KB |
subtask_1_04.txt | AC | 5 ms | 384 KB |
subtask_1_05.txt | AC | 5 ms | 384 KB |
subtask_1_06.txt | AC | 10 ms | 256 KB |
subtask_1_07.txt | AC | 4 ms | 256 KB |
subtask_1_08.txt | AC | 28 ms | 384 KB |
subtask_1_09.txt | AC | 32 ms | 384 KB |
subtask_1_10.txt | AC | 19 ms | 384 KB |
subtask_1_11.txt | AC | 19 ms | 384 KB |
subtask_1_12.txt | AC | 12 ms | 384 KB |
subtask_1_13.txt | AC | 11 ms | 384 KB |
subtask_1_14.txt | AC | 22 ms | 384 KB |
subtask_1_15.txt | AC | 6 ms | 384 KB |
subtask_1_16.txt | AC | 11 ms | 384 KB |
subtask_1_17.txt | AC | 7 ms | 384 KB |
subtask_1_18.txt | AC | 6 ms | 384 KB |
subtask_1_19.txt | AC | 22 ms | 384 KB |
subtask_1_20.txt | AC | 6 ms | 384 KB |
subtask_1_21.txt | AC | 11 ms | 384 KB |
subtask_1_22.txt | AC | 10 ms | 384 KB |
subtask_1_23.txt | AC | 19 ms | 384 KB |
subtask_1_24.txt | AC | 32 ms | 384 KB |
subtask_1_25.txt | AC | 10 ms | 384 KB |
subtask_1_26.txt | AC | 13 ms | 384 KB |
subtask_1_27.txt | AC | 32 ms | 384 KB |
subtask_1_28.txt | AC | 32 ms | 384 KB |
subtask_1_29.txt | AC | 19 ms | 384 KB |
subtask_1_30.txt | AC | 19 ms | 384 KB |