【NOIP模拟赛】刺客信条（AC）

• 题解 :枚举主教的攻击范围，再用并查集看两个主教中有没有路可以走，因为攻击范围必然是个圆

#include<bits/stdc++.h>
using namespace std;
int x,y,n;
int a[2005],b[2005];
struct oo{
	int u,v;
	long long l;
}edge[2005*2005];
int cnt;
int fa[2005];
long long ans;
void add_1(int i){
	cnt++;
	edge[cnt].u=i;
	edge[cnt].v=n+1;
	edge[cnt].l=(long long)min(a[i],y-b[i])*2;
	edge[cnt].l*=edge[cnt].l;
	cnt++;
	edge[cnt].u=i;
	edge[cnt].v=n+2;
	edge[cnt].l=(long long)min(x-a[i],b[i])*2;
	edge[cnt].l*=edge[cnt].l;
}
void add_2(int i,int j){
	cnt++;
	edge[cnt].u=i;
	edge[cnt].v=j;
	edge[cnt].l=(long long)(a[i]-a[j])*(long long)(a[i]-a[j])+(long long)(b[i]-b[j])*(long long)(b[i]-b[j]);
}
bool comp(oo a,oo b){
	return a.l<b.l;
}
int get(int x){
	if(x==fa[x])
		return x;
	return fa[x]=get(fa[x]);
}
int read(){
	int num=0,fa=1;
	char ch=getchar();
	while(ch>'9'||ch<'0'){
		if(ch=='-') fa=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9'){
		num=(num<<1)+(num<<3)+ch-'0';
		ch=getchar();
	}
	return num*fa;
}
int main(){
	x=read(),y=read(),n=read();
	for(int i=1;i<=n;i++)
		a[i]=read(),b[i]=read();
	for(int i=1;i<=n;i++){
		add_1(i);
		for(int j=1;j<i;j++)
			add_2(i,j);
	}
	sort(edge+1,edge+1+cnt,comp);
	for(int i=1;i<=n+2;i++)
		fa[i]=i;
	for(int i=1;i<=cnt;i++){
		int fu=get(edge[i].u);
		int fv=get(edge[i].v);
		if(fu==fv)
			continue;
		fa[fu]=fv;
		ans=max(ans,edge[i].l);
		if(get(n+1)==get(n+2))
			break;
	}
	printf("%.2lf",(double)sqrt(ans)/2);
	return 0;
}