GYM 102091L - Largest Allowed Area【二维前缀和+二分】

https://codeforces.com/gym/102091

 

 

题意：n*m的图由01构成，从里面找一个最大的正方形，其内的和<=1。

 

分析：预处理二维前缀和，二分正方形边长然后暴力n^2找。

需要快速读入，但即使适用快读也要跑满900ms，然后用高级输入外挂只跑了108ms。。。。

//#include "bits/stdc++.h"
//#include <unordered_map>
//#include <unordered_set>
#include <iostream>
#include <sstream>
#include <iterator>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <set>
#include <vector>
#include <bitset>
#include <climits>
#include <queue>
#include <iomanip>
#include <cmath>
#include <stack>
#include <map>
#include <ctime>
#include <new>

using namespace std;
#define LL long long
#define ULL unsigned long long
#define MT(a, b) memset(a,b,sizeof(a))
#define lson l, mid, node<<1
#define rson mid + 1, r, node<<1|1
#define Root 1, m, 1
#define Node l, r, node
const int INF = 0x3f3f3f3f;
const int O = 1e6;
const int mod = 998244353;
//const int maxn = 1e5 + 5;
const double PI = acos(-1.0);
const double E = 2.718281828459;
const double esp = 1e-7;
const  int maxE = 2e4 + 7, maxN = 207;
int a[1004][1004];
char s[10];
int pre[1004][1004];
int n,m;
bool che(int mid)
{
    for (int i = 1; i <= n; i++) {
        if(i+mid-1>n)break;
        for (int j = 1; j <= m; j++) {
            int x=i+mid-1;
            int y=j+mid-1;
            if(y>m)break;
            int sum=pre[x][y]-pre[x][j-1]-pre[i-1][y]+pre[i-1][j-1];
            if(sum<=1){
                //printf("%d %d \n",i,j);
                return 1;
            }
        }
    }
    return 0;
}
int main()
{
    int t;
    scanf("%d",&t);
    pre[0][0]=0;
    for(int i=0; i<=max(n, m); i++) pre[i][0] = 0, pre[0][i] = 0;
    while(t--)
    {
        scanf("%d%d",&n,&m);char ch;
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                ch=getchar();
                while(ch!='0'&&ch!='1')
                    ch=getchar();
                a[i][j]=ch-'0';
            }
        }
        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= m; j++) {
                pre[i][j]=pre[i-1][j]+pre[i][j-1]+a[i][j]-pre[i-1][j-1];
            }
        }
        int l=0,r=min(n,m);
        int ans=-1;
        while(l<=r)
        {
            int mid = (l+r)>>1;
            if(che(mid)){
                ans=mid;
                l=mid+1;
            }
            else r=mid-1;
        }
        printf("%d\n",ans);
    }
}