Submission #1133143
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int INF = 1e9; int n; map<vector<string>, int> memo; bool judge(vector<string>& a, char c) { for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (a[i][j] != c) return false; } } return true; } int solve(vector<string>& a, set<vector<string> > used) { if (memo.find(a) != memo.end()) return memo[a]; if (judge(a, '#')) return 0; if (judge(a, '.')) return INF; used.insert(a); int res = INF; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { vector<string> b(a); for (int k = 0; k < n; k++) { b[k][j] = a[i][k]; } if (used.find(b) != used.end()) continue; res = min(res, solve(b, used) + 1); } } memo[a] = res; return res; } int main() { cin.tie(0); ios::sync_with_stdio(false); cin >> n; if (n > 3) return 0; vector<string> a(n); for (int i = 0; i < n; i++) cin >> a[i]; int cnt = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (a[i][j] == '#') cnt++; } } if (cnt == 1) { cout << 2 * n - 1 << endl; return 0; } set<vector<string> > used; int ans = solve(a, used); cout << (ans == INF ? -1 : ans) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Row to Column |
User | fine |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1240 Byte |
Status | WA |
Exec Time | 36 ms |
Memory | 6016 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | 0 / 1000 | ||||||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
Subtask | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 2_00.txt, 2_01.txt, 2_02.txt, 2_03.txt, 2_04.txt, 2_05.txt, 2_06.txt, 2_07.txt, 2_08.txt, 2_09.txt, 2_10.txt, 2_11.txt, 2_12.txt, 2_13.txt, 2_14.txt, 2_15.txt, 2_16.txt, 2_17.txt, 2_18.txt, 2_19.txt, 2_20.txt, 2_21.txt, 2_22.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 1 ms | 256 KB |
0_01.txt | AC | 1 ms | 256 KB |
0_02.txt | AC | 1 ms | 256 KB |
0_03.txt | AC | 34 ms | 5120 KB |
0_04.txt | AC | 1 ms | 256 KB |
1_00.txt | AC | 1 ms | 256 KB |
1_01.txt | AC | 1 ms | 256 KB |
1_02.txt | AC | 1 ms | 256 KB |
1_03.txt | WA | 1 ms | 256 KB |
1_04.txt | WA | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | WA | 34 ms | 5376 KB |
1_07.txt | AC | 36 ms | 4736 KB |
1_08.txt | AC | 35 ms | 5632 KB |
1_09.txt | AC | 34 ms | 5120 KB |
1_10.txt | WA | 1 ms | 256 KB |
1_11.txt | AC | 34 ms | 5120 KB |
1_12.txt | AC | 1 ms | 256 KB |
1_13.txt | AC | 36 ms | 5632 KB |
1_14.txt | AC | 34 ms | 6016 KB |
2_00.txt | WA | 1 ms | 256 KB |
2_01.txt | WA | 1 ms | 256 KB |
2_02.txt | WA | 1 ms | 256 KB |
2_03.txt | WA | 1 ms | 256 KB |
2_04.txt | WA | 1 ms | 256 KB |
2_05.txt | WA | 1 ms | 256 KB |
2_06.txt | WA | 1 ms | 256 KB |
2_07.txt | WA | 1 ms | 256 KB |
2_08.txt | WA | 1 ms | 256 KB |
2_09.txt | WA | 1 ms | 256 KB |
2_10.txt | WA | 1 ms | 256 KB |
2_11.txt | WA | 1 ms | 256 KB |
2_12.txt | WA | 1 ms | 256 KB |
2_13.txt | WA | 1 ms | 256 KB |
2_14.txt | WA | 1 ms | 256 KB |
2_15.txt | WA | 1 ms | 256 KB |
2_16.txt | WA | 1 ms | 256 KB |
2_17.txt | WA | 1 ms | 256 KB |
2_18.txt | WA | 1 ms | 256 KB |
2_19.txt | WA | 1 ms | 256 KB |
2_20.txt | WA | 1 ms | 256 KB |
2_21.txt | WA | 1 ms | 256 KB |
2_22.txt | WA | 1 ms | 256 KB |