제출 #1128728

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128728		Noproblem29	Bomb (IZhO17_bomb)	C++20	24 / 100	91 ms	6800 KiB

bomb

#include<bits/stdc++.h>
using namespace std;
#ifndef BADGNU
#pragma GCC target("sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#endif
#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds;
#define ll long long
// #define int ll
#define ld long double
#define y1 cheza
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
template<class T> using ordered_multiset = tree<T,null_type,less_equal<T>,rb_tree_tag,tree_order_statistics_node_update>;
const int N=2600;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
const int dx[]={1,-1,0,0};
const int dy[]={0,0,1,-1};
const double eps=1e-6;
int n,m;
char a[N][N];
void test(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>a[i][j];
        }
    }
    int x=2500;
    int y=2500;
    for(int i=1;i<=n;i++){
        int cur=0;
        for(int j=1;j<=m;j++){
            if(a[i][j]=='1'){
                cur++;
            }
            else{
                if(cur!=0){
                    x=min(x,cur);
                }
                cur=0;
            }
        }
        if(cur!=0){
            x=min(x,cur);
        }
    }
     for(int j=1;j<=m;j++){
        int cur=0;
        for(int i=1;i<=n;i++){
            if(a[i][j]=='1'){
                cur++;
            }
            else{
                if(cur!=0){
                    y=min(y,cur);
                }
                cur=0;
            }
        }
        if(cur!=0){
            y=min(y,cur);
        }
    }
    cout<<x*y<<'\n';
}



/*

*/
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    // cout.tie(nullptr);
    int t2=1;
    // cin>>t2;
    for(int i=1;i<=t2;i++){
        test();
    }
}

• Subtask 1: 24 / 100