Submission #833250

#TimeUsernameProblemLanguageResultExecution timeMemory
833250vjudge1Bomb (IZhO17_bomb)C++17
15 / 100
240 ms6476 KiB
#include <bits/stdc++.h> #define ll long long using namespace std; void solve() { int n,m; cin >> n >> m; char grid[n+1][m+1]; for (int i=0; i<n; i++) { for (int j=0; j<m; j++) { cin >> grid[i][j]; } } int w=m; for (int i=0; i<n; i++) { int mn=0, tw=w;; for (int 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; int h=n; for (int i=0; i<m; i++) { int mn=0, th=h; for (int 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 timeMemoryGrader output
Fetching results...