Submission #3621196
Source Code Expand
#include <iostream> #include <iomanip> #include <cmath> #include <algorithm> #include <vector> #include <queue> #include <map> #include <set> using namespace std; bool solve(const vector<string> &S, vector<int> &perm){ int H = S.size(); int W = S[0].size(); vector<vector<int>> T(H, vector<int>(W)); for(int i=0; i<H; i++) for(int j=0; j<W; j++) T[i][j] = S[perm[i]][j] - 'a'; // for(int i=0; i<H; i++){ // for(int j=0; j<W; j++){ // cerr << char('a'+T[i][j]) << " "; // } // cerr << endl; // } vector<bool> used(W, false); for(int i=0; i<W; i++){ if(used[i]) continue; for(int j=i+1; j<W; j++){ if(used[j]) continue; bool ok = true; for(int k=0; k<H; k++){ if(T[k][i] != T[H-1-k][j]){ ok = false; break; } } if(ok){ used[i] = true; used[j] = true; break; } } } int cnt = 0; for(int i=0; i<W; i++) if(used[i]) cnt++; cnt = W - cnt; if(cnt == 0) return true; if(cnt > 1) return false; int idx = 0; for(int i=0; i<W; i++) if(!used[i]) idx = i; for(int i=0; i<H; i++) if(T[i][idx] != T[H-1-i][idx]) return false; return true; } int main(){ int H, W; cin >> H >> W; vector<string> S(H); for(int i=0; i<H; i++) cin >> S[i]; for(int i=0; i<(1<<H); i++){ if(__builtin_popcount(i) != (H+1)/2) continue; vector<string> T; for(int j=0; j<H; j++) if(i & (1<<j)) T.push_back(S[j]); for(int j=0; j<H; j++) if(!(i & (1<<j))) T.push_back(S[j]); vector<int> perm; for(int i=0; i<H; i++) perm.push_back(i); do{ if(solve(T, perm)){ cout << "YES" << endl; return 0; } }while(next_permutation(perm.begin(), perm.begin()+(H+1)/2)); } cout << "NO" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | E - Symmetric Grid |
User | suzume |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 2267 Byte |
Status | AC |
Exec Time | 611 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 700 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, 1.txt, 10.txt, 100.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 2.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 3.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 4.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 5.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 6.txt, 7.txt, 8.txt, 9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
1.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
100.txt | AC | 2 ms | 256 KB |
11.txt | AC | 24 ms | 256 KB |
12.txt | AC | 24 ms | 256 KB |
13.txt | AC | 10 ms | 256 KB |
14.txt | AC | 4 ms | 256 KB |
15.txt | AC | 20 ms | 256 KB |
16.txt | AC | 610 ms | 256 KB |
17.txt | AC | 285 ms | 256 KB |
18.txt | AC | 137 ms | 256 KB |
19.txt | AC | 280 ms | 256 KB |
2.txt | AC | 1 ms | 256 KB |
20.txt | AC | 148 ms | 256 KB |
21.txt | AC | 286 ms | 256 KB |
22.txt | AC | 579 ms | 256 KB |
23.txt | AC | 280 ms | 256 KB |
24.txt | AC | 3 ms | 256 KB |
25.txt | AC | 4 ms | 256 KB |
26.txt | AC | 288 ms | 256 KB |
27.txt | AC | 285 ms | 256 KB |
28.txt | AC | 599 ms | 256 KB |
29.txt | AC | 45 ms | 256 KB |
3.txt | AC | 1 ms | 256 KB |
30.txt | AC | 132 ms | 256 KB |
31.txt | AC | 275 ms | 256 KB |
32.txt | AC | 30 ms | 256 KB |
33.txt | AC | 285 ms | 256 KB |
34.txt | AC | 580 ms | 256 KB |
35.txt | AC | 591 ms | 256 KB |
36.txt | AC | 31 ms | 256 KB |
37.txt | AC | 3 ms | 256 KB |
38.txt | AC | 286 ms | 256 KB |
39.txt | AC | 19 ms | 256 KB |
4.txt | AC | 1 ms | 256 KB |
40.txt | AC | 579 ms | 256 KB |
41.txt | AC | 280 ms | 256 KB |
42.txt | AC | 578 ms | 256 KB |
43.txt | AC | 610 ms | 256 KB |
44.txt | AC | 2 ms | 256 KB |
45.txt | AC | 3 ms | 256 KB |
46.txt | AC | 2 ms | 256 KB |
47.txt | AC | 20 ms | 256 KB |
48.txt | AC | 284 ms | 256 KB |
49.txt | AC | 588 ms | 256 KB |
5.txt | AC | 1 ms | 256 KB |
50.txt | AC | 280 ms | 256 KB |
51.txt | AC | 70 ms | 256 KB |
52.txt | AC | 598 ms | 256 KB |
53.txt | AC | 610 ms | 256 KB |
54.txt | AC | 1 ms | 256 KB |
55.txt | AC | 1 ms | 256 KB |
56.txt | AC | 611 ms | 256 KB |
6.txt | AC | 1 ms | 256 KB |
7.txt | AC | 1 ms | 256 KB |
8.txt | AC | 1 ms | 256 KB |
9.txt | AC | 1 ms | 256 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 154 ms | 256 KB |