[P2658]汽车拉力比赛

原题链接

二分

#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<queue>
#include<vector>
#include<climits>
#include<string>
#include<cstdlib>
#include<ctime>
#define LL long long
#define MOD 1000000007
#define pi 3.141592653589
using namespace std;

int dx[5]={0,1,0,-1,0},dy[5]={0,0,1,0,-1};
int n,m,i,j,h[505][505],l,r,maxn,minn,cnt,mid,mark[505][505],f[505][505],x[250005],y[250005],mx,my;

bool check(int d)
{
    int head,tail,tot=1,xx,yy;

    memset(f,0,sizeof(f));

    head=1;
    tail=1;
    x[1]=mx;
    y[1]=my;
    f[y[1]][x[1]]=1;

    while(head<=tail)
    {
        if(tot==cnt) return true;

        for(i=1;i<=4;i++)
        {
            xx=x[head]+dx[i];
            yy=y[head]+dy[i];           

            if((!f[yy][xx])&&(abs(h[yy][xx]-h[y[head]][x[head]])<=d)&&(xx<=n)&&(xx>=1)&&(yy<=m)&&(yy>=1))
            {
                tail++;
                x[tail]=xx; 
                y[tail]=yy;
                f[yy][xx]=1;
                if(mark[yy][xx]==1) tot++;
            }
        }

        head++;
    }

    return false;
}

int main()
{
    scanf("%d%d",&m,&n);

    for(i=1;i<=m;i++)
        for(j=1;j<=n;j++)
        {
            scanf("%d",&h[i][j]);
            maxn=max(maxn,h[i][j]);     
        }

    r=maxn;
    l=0;

    for(i=1;i<=m;i++)
        for(j=1;j<=n;j++)
        {
            scanf("%d",&mark[i][j]);    

            if(mark[i][j]==1)
            {
                cnt++;

                if(cnt==1)
                {
                    my=i;
                    mx=j;                   
                }
            }       
        }

    while(l<=r)
    {
        mid=(l+r)>>1;

        if(check(mid)) r=mid-1;
        else l=mid+1;
    }

    printf("%d",l);

    return 0;
}