# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
422187 | antimirage | Bomb (IZhO17_bomb) | C++14 | 427 ms | 31120 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 <iostream>
#include <assert.h>
using namespace std;
const int N = 2505;
int n, m, a[N][N], w = N, h = N;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
scanf("\n");
for (int j = 1; j <= m; j++) {
char ch;
scanf("%c", &ch);
a[i][j] = ch - 48;
}
}
for (int i = 1; i <= n; i++) {
int last = 0;
for (int j = 1; j <= m + 1; j++) {
if (a[i][j] == 0) {
if (last != j - 1)
w = min(w, j - last - 1);
last = j;
}
}
}
for (int j = 1; j <= m; j++) {
int last = 0;
for (int i = 1; i <= n + 1; i++) {
if (a[i][j] == 0) {
if (last != i - 1)
h = min(h, i - last - 1);
last = i;
}
}
}
if (w == N)
assert(0);
cout << w * h << endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |