# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
168965 | abil | Bomb (IZhO17_bomb) | C++14 | 687 ms | 12916 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>
#define fr first
#define sc second
#define pb push_back
#define mk make_pair
#define all(s) s.begin(),s.end()
//#define int long long
using namespace std;
const int N = (2500 + 12);
const int mod = (1e9 + 7);
const int INF = (0x3f3f3f3f);
char a[N][N];
main()
{
int n, m;
cin >> n >> m;
for(int i = 1;i <= n; i++){
for(int j = 1;j <= m; j++){
cin >> a[i][j];
}
}
int x = INF, y = INF;
for(int i = 1;i <= n; i++){
int cnt = 0;
for(int j = 1;j <= m; j++){
if(cnt > 0 && a[i][j] == '0'){
x = min(x, cnt);
cnt = 0;
}
else
if(a[i][j] == '1'){
cnt++;
}
}
}
for(int i = 1;i <= m; i++){
int cnt = 0;
for(int j = 1;j <= n; j++){
if(cnt > 0 && a[j][i] == '0'){
y = min(y, cnt);
cnt = 0;
}
else
if(a[j][i] == '1'){
cnt++;
}
}
}
cout << x * y;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |