cf126C. Arson In Berland Forest

链接

点击跳转

题解

求出每个点到边界的最近距离，然后二分

check就是扫一遍，看下能不能以这个点为中心放下一个“四周都扩展出去t”的矩形，能放就放，最后再扫一遍，看看有没有’X’没被覆盖到

代码

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define iinf 0x3f3f3f3f
#define linf (1ll<<60)
#define eps 1e-8
#define maxn 3000010
#define cl(x) memset(x,0,sizeof(x))
#define rep(_,__) for(_=1;_<=(__);_++)
#define em(x) emplace(x)
#define emb(x) emplace_back(x)
#define emf(x) emplace_front(x)
#define fi first
#define se second
#define de(x) cerr<<#x<<" = "<<x<<endl
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll read(ll x=0)
{
    ll c, f(1);
    for(c=getchar();!isdigit(c);c=getchar())if(c=='-')f=-f;
    for(;isdigit(c);c=getchar())x=x*10+c-0x30;
    return f*x;
}
int s[maxn], n, m, k[maxn];
char mp[maxn];
int code(int i, int j)
{
    return (i+1)*(m+2)+j;
}
int q(int x1, int y1, int x2, int y2)
{
    x1--, y1--;
    return s[code(x2,y2)] + s[code(x1,y1)] - s[code(x1,y2)] - s[code(x2,y1)];
}
void add(int x1, int y1, int x2, int y2)
{
    x2++, y2++;
    s[code(x1,y1)]++, s[code(x2,y2)]++;
    s[code(x1,y2)]--, s[code(x2,y1)]--;
}
bool check(int t)
{
    cl(s);
    int i, j;
    rep(i,n)rep(j,m)
    {
        if(mp[code(i,j)]=='X' and t<=k[code(i,j)])
        {
            add(i-t,j-t,i+t,j+t);
        }
    }
    rep(i,n)rep(j,m)
    {
        s[code(i,j)]+=s[code(i-1,j)]+s[code(i,j-1)]-s[code(i-1,j-1)];
    }
    rep(i,n)rep(j,m)
    {
        if(mp[code(i,j)]=='X' and s[code(i,j)]==0)
        {
            return false;
        }
    }
    return true;
}
int main()
{
    ll i, j;
    n=read(), m=read();
    rep(i,n)
    {
        scanf("%s",mp+code(i,1));
        rep(j,m)
        {
            s[code(i,j)]=s[code(i-1,j)]+s[code(i,j-1)]-s[code(i-1,j-1)]+(mp[code(i,j)]=='X');
        }
    }
    int mx=-iinf;
    rep(i,n)rep(j,m)
    {
        ll l=0, r= min( min(i,n-i), min(j,m-j) ), mid;
        if(q(i,j,i,j)==0)continue;
        while(l<r)
        {
            mid=l+r+1>>1;
            ll S=(1+2*mid)*(1+2*mid);
            if(q(i-mid,j-mid,i+mid,j+mid)==S)l=mid;
            else r=mid-1;
        }
        k[code(i,j)]=l;
    }
    ll l=0, r=1e6;
    while(l<r)
    {
        ll mid=(l+r+1)>>1;
        if(check(mid))l=mid;
        else r=mid-1;
    }
    printf("%lld\n",l);
    rep(i,n)rep(j,m)
    {
        if(mp[code(i,j)]=='X' and l<=k[code(i,j)])
        {
            putchar('X');
        }
        else putchar('.');
        if(j==m)putchar(10);
    }
    return 0;
}