# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
915563 | vjudge1 | Bomb (IZhO17_bomb) | C++17 | 58 ms | 56400 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.
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
#include <vector>
#define int long long
#define pb push_back
#define str string
using namespace std;
int pp[3001];
void solve(){
int n,m;
cin>>n>>m;
if(n<=3000 && m<=3000){
str s[n+3];
int a[n+3][m+3];
int o=0;
int ss=10000000,b=10000000;
for(int i=1;i<=n;i++){
cin>>s[i];
int k=0;
for(int j=0;j<m;j++){
a[i][j+1]=s[i][j]-'0';
if(a[i][j+1]==1){
k++;
pp[j+1]++;
}
else{
if(k>0){
ss=min(ss,k);
k=0;
}
if(pp[j+1]>0){
b=min(b,pp[j+1]);
pp[j+1]=0;
}
}
if(pp[j+1]>0 && i==n){
b=min(b,pp[j+1]);
//pp[j+1]=0;
}
}
if(k>0){
ss=min(ss,k);
k=0;
}
}
cout<<ss*b;
}
}
signed main(){
ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
//srand( time(0));
//rand()
//freopen("sum.in", "r", stdin);
//freopen("sum.out", "w", stdout);
int tests=1;
//cin>>tests;
for(int i=1;i<=tests;i++){
//cout<<"TEST CASE : "<<i<<"\n";
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |