Submission #2151886
Source Code Expand
#include <bits/stdc++.h> using namespace std; const int N = 510; const int INF = 1e9; int n; string a[N]; int res = INF; int col[N]; bool any; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cin >> n; for (int i = 0; i < n; ++i) { cin >> a[i]; for (int j = 0; j < n; ++j) if (a[i][j] == '#') ++col[j], any = 1; } if (!any) { printf("-1\n"); return 0; } for (int i = 0; i < n; ++i) { int cur = 0; if (!col[i]) ++cur; for (int j = 0; j < n; ++j) { if (col[j] != n) ++cur; } for (int j = 0; j < n; ++j) { if (a[i][j] == '.') ++cur; } res = min(res, cur); } if (res != INF) printf("%d\n", res); else printf("-1\n"); }
Submission Info
Submission Time | |
---|---|
Task | B - Row to Column |
User | cheater2k |
Language | C++14 (GCC 5.4.1) |
Score | 1300 |
Code Size | 805 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | Subtask | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | 1000 / 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 | AC | 1 ms | 256 KB |
1_04.txt | AC | 1 ms | 256 KB |
1_05.txt | AC | 1 ms | 256 KB |
1_06.txt | AC | 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 | AC | 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 | 2 ms | 512 KB |
2_01.txt | AC | 2 ms | 512 KB |
2_02.txt | AC | 2 ms | 512 KB |
2_03.txt | AC | 2 ms | 512 KB |
2_04.txt | AC | 2 ms | 512 KB |
2_05.txt | AC | 2 ms | 512 KB |
2_06.txt | AC | 2 ms | 512 KB |
2_07.txt | AC | 3 ms | 512 KB |
2_08.txt | AC | 3 ms | 512 KB |
2_09.txt | AC | 3 ms | 512 KB |
2_10.txt | AC | 3 ms | 512 KB |
2_11.txt | AC | 3 ms | 512 KB |
2_12.txt | AC | 3 ms | 512 KB |
2_13.txt | AC | 3 ms | 512 KB |
2_14.txt | AC | 3 ms | 512 KB |
2_15.txt | AC | 2 ms | 512 KB |
2_16.txt | AC | 2 ms | 512 KB |
2_17.txt | AC | 2 ms | 512 KB |
2_18.txt | AC | 2 ms | 460 KB |
2_19.txt | AC | 2 ms | 512 KB |
2_20.txt | AC | 2 ms | 512 KB |
2_21.txt | AC | 2 ms | 384 KB |
2_22.txt | AC | 2 ms | 512 KB |