Submission #1518570
Source Code Expand
#include <string> #include <iostream> #include <algorithm> using namespace std; int N, c, ret; string s[509]; int main() { cin >> N; ret = N + 2; for (int i = 0; i < N; i++) { cin >> s[i]; c = 0; for (int j = 0; j < N; j++) { if (s[i][j] == '.') c++; } if (s[i][i] == '.') c += 2; ret = min(ret, c); } for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { if (s[j][i] == '.') { ret++; break; } } } cout << (ret != 2 * N + 2 ? ret : -1) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Row to Column |
User | square1001 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 520 Byte |
Status | WA |
Exec Time | 11 ms |
Memory | 512 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 | 1 ms | 256 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 | 1 ms | 256 KB |
1_07.txt | AC | 1 ms | 256 KB |
1_08.txt | AC | 1 ms | 256 KB |
1_09.txt | AC | 1 ms | 256 KB |
1_10.txt | WA | 1 ms | 256 KB |
1_11.txt | AC | 1 ms | 256 KB |
1_12.txt | AC | 1 ms | 256 KB |
1_13.txt | AC | 1 ms | 256 KB |
1_14.txt | AC | 1 ms | 256 KB |
2_00.txt | AC | 10 ms | 512 KB |
2_01.txt | AC | 10 ms | 512 KB |
2_02.txt | AC | 10 ms | 512 KB |
2_03.txt | WA | 10 ms | 512 KB |
2_04.txt | WA | 10 ms | 512 KB |
2_05.txt | AC | 10 ms | 512 KB |
2_06.txt | WA | 10 ms | 512 KB |
2_07.txt | WA | 8 ms | 512 KB |
2_08.txt | AC | 10 ms | 512 KB |
2_09.txt | AC | 10 ms | 512 KB |
2_10.txt | AC | 10 ms | 512 KB |
2_11.txt | WA | 11 ms | 512 KB |
2_12.txt | AC | 10 ms | 512 KB |
2_13.txt | AC | 9 ms | 512 KB |
2_14.txt | WA | 9 ms | 512 KB |
2_15.txt | WA | 8 ms | 512 KB |
2_16.txt | WA | 8 ms | 512 KB |
2_17.txt | WA | 8 ms | 512 KB |
2_18.txt | WA | 7 ms | 512 KB |
2_19.txt | AC | 9 ms | 512 KB |
2_20.txt | AC | 7 ms | 512 KB |
2_21.txt | AC | 6 ms | 512 KB |
2_22.txt | AC | 10 ms | 512 KB |