# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1046836 | wenqi | Bomb (IZhO17_bomb) | C++17 | 63 ms | 31080 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;
using ll = long long;
#define all(x) x.begin(), x.end()
int N, M, grid[2505][2505];
int main(int, const char **) {
cin.tie(NULL)->sync_with_stdio(false);
cin >> N >> M;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
char x;
cin >> x;
grid[i][j] = x - '0';
}
}
int a = 1e9, b = 1e9;
for (int i = 1; i <= N; i++) {
int cnt = 0;
for (int j = 1; j <= M; j++) {
if (grid[i][j]) {
cnt++;
} else if (cnt) {
a = min(a, cnt);
cnt = 0;
}
}
if (cnt) a = min(a, cnt);
}
for (int j = 1; j <= M; j++) {
int cnt = 0;
for (int i = 1; i <= N; i++) {
if (grid[i][j]) {
cnt++;
} else if (cnt) {
b = min(b, cnt);
cnt = 0;
}
}
if (cnt) b = min(b, cnt);
}
cout << (ll)a * b;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |