Submission #2427188
Source Code Expand
/** * File : B.cpp * Author : Kazune Takahashi * Created : 2018-4-28 21:09:25 * Powered by Visual Studio Code */ #include <iostream> #include <iomanip> // << fixed << setprecision(xxx) #include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ; #include <vector> #include <string> // to_string(nnn) // substr(m, n) // stoi(nnn) #include <complex> #include <tuple> #include <queue> #include <stack> #include <map> // if (M.find(key) != M.end()) { } #include <set> #include <random> // random_device rd; mt19937 mt(rd()); #include <cctype> #include <cassert> #include <cmath> #include <cstdio> #include <cstdlib> using namespace std; #define DEBUG 0 // change 0 -> 1 if we need debug. typedef long long ll; // const int dx[4] = {1, 0, -1, 0}; // const int dy[4] = {0, 1, 0, -1}; // const int C = 1e6+10; // const ll M = 1000000007; int N; string S[310]; string T[310]; int main() { cin >> N; for (auto i = 0; i < N; i++) { cin >> S[i]; } int ans = 0; for (auto i = 0; i < N; i++) { T[i] = ""; for (auto j = 0; j < N; j++) { T[i] += S[j][i]; } } for (auto k = 0; k < N; k++) { bool ok = true; for (auto i = 0; i < N; i++) { if (T[i] != S[(i + k) % N]) { ok = false; break; } } if (ok) { ans++; } for (auto i = 0; i < N; i++) { T[i] = T[i].substr(1, N - 1) + T[i].substr(0, 1); } } cout << ans * N << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - Find Symmetries |
User | kazunetakahashi |
Language | C++14 (GCC 5.4.1) |
Score | 500 |
Code Size | 1545 Byte |
Status | AC |
Exec Time | 24 ms |
Memory | 640 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 | 20 ms | 640 KB |
subtask_1_04.txt | AC | 18 ms | 512 KB |
subtask_1_05.txt | AC | 15 ms | 512 KB |
subtask_1_06.txt | AC | 12 ms | 384 KB |
subtask_1_07.txt | AC | 15 ms | 512 KB |
subtask_1_08.txt | AC | 22 ms | 640 KB |
subtask_1_09.txt | AC | 24 ms | 640 KB |
subtask_1_10.txt | AC | 22 ms | 640 KB |
subtask_1_11.txt | AC | 21 ms | 640 KB |
subtask_1_12.txt | AC | 22 ms | 640 KB |
subtask_1_13.txt | AC | 22 ms | 640 KB |
subtask_1_14.txt | AC | 21 ms | 640 KB |
subtask_1_15.txt | AC | 21 ms | 640 KB |
subtask_1_16.txt | AC | 22 ms | 640 KB |
subtask_1_17.txt | AC | 22 ms | 640 KB |
subtask_1_18.txt | AC | 21 ms | 640 KB |
subtask_1_19.txt | AC | 22 ms | 640 KB |
subtask_1_20.txt | AC | 21 ms | 640 KB |
subtask_1_21.txt | AC | 22 ms | 640 KB |
subtask_1_22.txt | AC | 22 ms | 640 KB |
subtask_1_23.txt | AC | 22 ms | 640 KB |
subtask_1_24.txt | AC | 24 ms | 640 KB |
subtask_1_25.txt | AC | 21 ms | 640 KB |
subtask_1_26.txt | AC | 22 ms | 640 KB |
subtask_1_27.txt | AC | 24 ms | 640 KB |
subtask_1_28.txt | AC | 24 ms | 640 KB |
subtask_1_29.txt | AC | 22 ms | 640 KB |
subtask_1_30.txt | AC | 22 ms | 640 KB |