# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
833359 | vjudge1 | Bomb (IZhO17_bomb) | C++17 | 13 ms | 7120 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
string s[2505];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
if (n != 1 && m != 1) return 0;
int W = m, H = n;
for (int i = 0; i < n; i++) {
int cnt = 0;
for (int j = 0; j < m; j++) {
if (s[i][j] == '1') {
if (j-1 < 0 || s[i][j-1] == '0') cnt = 1;
else cnt++;
} else {
if (j-1 >= 0 && s[i][j-1] == '1') W = min(W, cnt);
cnt = 0;
}
}
if (s[i][m-1] == '1') W = min(W, cnt);
}
for (int j = 0; j < m; j++) {
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i][j] == '1') {
if (i-1 < 0 || s[i-1][j] == '0') cnt = 1;
else cnt++;
} else {
if (i-1 >= 0 && s[i-1][j] == '1') H = min(H, cnt);
cnt = 0;
}
}
if (s[n-1][j] == '1') H = min(H, cnt);
}
cout << W*H << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |