一道图论思路题
一开始想到了二分答案+并查集
期望得分是70,但卡卡就过了
http://www.cnblogs.com/ppprseter/p/9301627.html
几种正解都在这,写的很详细我懒得写了
嗯就这样放上我的SPFA代码:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<cctype>
#include<queue>
#define maxn 3010
using namespace std;
int n;
double g[maxn][maxn],x[maxn],y[maxn],dis[maxn],row,line;
queue<int> q;
bool vis[maxn];
inline void spfa(){
for(int i=1;i<=n+1;i++) dis[i]=1e16;
q.push(0);
while(!q.empty()){
int u=q.front(); q.pop();
vis[u]=0;
for(int i=1;i<=n+1;i++)
if(i!=u && dis[i]>max(dis[u],g[u][i])){
dis[i]=max(dis[u],g[u][i]);
if(!vis[i]) q.push(i),vis[i]=1;
}
}
}
int main(){
scanf("%d%lf%lf",&n,&row,&line);
for(int i=1;i<=n;i++) scanf("%lf%lf",&x[i],&y[i]);
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
if(i!=j){
double d=(double)sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]));
g[i][j]=g[j][i]=d/2;
}
for(int i=1;i<=n;i++)
g[0][i]=g[i][0]=min(x[i]-1,line-y[i]),
g[i][n+1]=g[n+1][i]=min(row-x[i],y[i]-1);
g[0][n+1]=g[n+1][0]=1e16;
spfa();
printf("%.2lf",dis[n+1]);
return 0;
}
还有一个二分+并查集卡过别人写的:
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <algorithm>
using namespace std;
inline int read(){
int x=0,f=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
return x*f;
}
const int MAXN=3010;
int n,fa[MAXN];
double Row,Line;
bool vis[MAXN];
struct Boss{
double x,y;
}a[MAXN];
int Getf(int x){
return fa[x]==x?x:fa[x]=Getf(fa[x]);
}
inline void Merge(int x,int y){
int xx=Getf(x),yy=Getf(y);
if(xx!=yy) fa[yy]=xx;
}
inline bool Check(double mid){
for(int i=1;i<=n+4;i++) fa[i]=i;
for(int i=1;i<=n;i++){
if(a[i].x-1<mid) Merge(i,n+3);
if(Row-a[i].x<mid) Merge(i,n+1);
if(a[i].y-1<=mid) Merge(i,n+2);
if(Line-a[i].y<mid) Merge(i,n+4);
for(int j=i+1;j<=n;j++){
if((a[i].x-a[j].x)*(a[i].x-a[j].x)+(a[i].y-a[j].y)*(a[i].y-a[j].y)<4*mid*mid) Merge(i,j);
}
}
int Up=Getf(n+1),Left=Getf(n+2),Down=Getf(n+3),Right=Getf(n+4);
return Up!=Down&&Up!=Right&&Left!=Down&&Left!=Right;
}
int main(){
n=read(),Row=read(),Line=read();
for(int i=1;i<=n;i++){
a[i].x=read(),a[i].y=read();
}
double l=0.0,r=min(Row,Line),ans;
while(r-l>1e-4){
double mid=(l+r)/2;
if(Check(mid)) ans=mid,l=mid;
else r=mid;
}
printf("%.2lf\n",ans);
return 0;
}