# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
833303 | vjudge1 | Bomb (IZhO17_bomb) | C++17 | 237 ms | 6512 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 ll long long
using namespace std;
void solve() {
ll n,m;
cin >> n >> m;
char grid[n+1][m+1];
for (ll i=0; i<n; i++) {
for (ll j=0; j<m; j++) {
cin >> grid[i][j];
}
}
ll w=m;
for (ll i=0; i<n; i++) {
ll mn=0, tw=w;;
for (ll j=0; j<m; j++) {
if (grid[i][j]=='1') {
while(j<m && grid[i][j]=='1') {
mn++;
j++;
}
w=min(w,mn);
}
}
if (w==0) {
w=tw;
}
}
// cout << w << endl;
ll h=n;
for (ll i=0; i<m; i++) {
ll mn=0, th=h;
for (ll j=0; j<n; j++) {
if (grid[j][i]=='1') {
while(j<n && grid[j][i]=='1') {
mn++;
j++;
}
h=min(h,mn);
}
}
if (h==0) {
h=th;
}
}
// cout << h << "\n";
ll res=(ll)w*(ll)h;
cout << res << "\n";
}
int main() {
int tc=1;
// cin >> tc;
while(tc--) {
solve();
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |