제출 #833567

#제출 시각아이디문제언어결과실행 시간메모리
833567vjudge1Bomb (IZhO17_bomb)C++17
24 / 100
83 ms6524 KiB
#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int MX = 2505;

char inp[MX][MX];
//int board[MX][MX];
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n,m;
    cin >> n >> m;
    for(int i =1 ; i<= n ; i++)
    {
        for(int j =1 ; j <= m;j++)
        {
            cin >> inp[i][j];
            //board[i][j] = inp[i][j] - '0';
        }
    }
    int maxW = 1e9, maxH = 1e9;
    for(int i =1 ; i<= n ; i++)
    {
        int mW = 1e9,cur = 0;
        for(int j =1 ; j <= m;j++)
        {
           if(inp[i][j] == '1'){
            cur++;
           }else{
            if(cur != 0){
                mW = min(mW,cur);
            }
            cur = 0;
           }
        }
        if(cur != 0){
                mW = min(mW,cur);
            } 
        if(mW != 1e9){
            maxW = min(maxW,mW);
        }  
    }
    for(int j =1 ; j<= m ; j++)
    {
        int mW = 1e9,cur = 0;
        for(int i =1 ; i <= n;i++)
        {
           if(inp[i][j] == '1'){
            cur++;
           }else{
            if(cur != 0){
                mW = min(mW,cur);
            }
            cur = 0;
           }
        }
        if(cur != 0){
                mW = min(mW,cur);
            } 
        if(mW != 1e9){
            maxH = min(maxH,mW);
        }  
    }
    cout << maxW*maxH;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...