<JZOJ5904>刺客信条

然鹅考场上打错某变量名导致30都没有

调了很久因为

没转换double

死亡

#include<cstdio>
#include<algorithm>
#include<cmath>
#define rint register int
using std::max;
int x,y,n,fa[],s,e;
double ans,l,r,dis[][],mid;
struct node
{
    int x,y;
} a[];
int find(int x)
{
    return x==fa[x]?x:fa[x]=find(fa[x]);
}
bool check(double L)
{
    for(int i=;i<=n+;i++) fa[i]=i;
    for(int i=;i<=n;i++)
    {
        for(int j=;j<=n;j++)
        {
            if(i==j) continue;
            if(dis[i][j]<*L)
                fa[find(j)]=find(i);
        }
    }
    for(rint i=;i<=n;++i)
    {
        if(a[i].y-L<||a[i].x+L>x)     fa[find(s)]=find(i);
        if(a[i].x-L<||a[i].y+L>y)     fa[find(e)]=find(i);
    }
    return find(s)!=find(e);
}

int main()
{
    freopen("AC.in","r",stdin);
    freopen("AC.out","w",stdout);
    scanf("%d%d%d",&x,&y,&n);
    for(int i=;i<=n;i++)
        scanf("%d%d",&a[i].x,&a[i].y);

    for(rint i=;i<=n;++i)
        for(rint j=;j<=n;++j)
            dis[i][j]=dis[j][i]=sqrt((double)(a[i].x-a[j].x)*(double)(a[i].x-a[j].x)+(double)(a[i].y-a[j].y)*(double)(a[i].y-a[j].y));        

    s=;e=n+;
    l=,r=sqrt((double)x*x+(double)y*y);
    while(r-l>=0.000001)
    {
        double mid=(l+r)/;
        if(check(mid))
        {
            ans=mid;
            l=mid;
        }
        else r=mid;
    }
    printf("%.2lf",ans);
    return ;
}