H - Highways

prime算法来做

#include<iostream>
#include<cstdio>
#include<queue>
#include<cmath>
#include<cstring>
using namespace std;
const int maxn=2000+10;
const int INF=1000000;
double G[maxn][maxn];
int vis[maxn];
struct point{
	double x,y;
}p[maxn];
struct node{
	int u,v;
	double len;
}dis[maxn];
double len(point a,point b)
{
	double x=a.x-b.x;
	double y=a.y-b.y;
	return sqrt(x*x+y*y);
}
void prime(int n)
{
	memset(vis,0,sizeof(vis));
	vis[1]=1;
	for(int i=1;i<=n;i++)
		dis[i].v=1,dis[i].len=G[1][i];
	for(int i=1;i<n;i++)
	{
		int k=0;double minn=INF;
		for(int j=1;j<=n;j++)
		{
			if(!vis[j]&&dis[j].len<minn)
			minn=dis[k=j].len;
		}
		vis[k]=1;
		for(int j=1;j<=n;j++)
		{
			if(!vis[j]&&k!=j&&G[k][j]<dis[j].len)
				dis[j].len=G[k][j],dis[j].v=k;
		}
	}
}
int main()
{
	int n,m;
	freopen("H.txt","r",stdin);
	while(scanf("%d",&n)!=EOF)
	{
		//cout<<n<<endl;
		for(int i=1;i<=n;i++)
		{
			scanf("%d %d",&p[i].x,&p[i].y);
			for(int j=1;j<i;j++)
			{
				G[i][j]=G[j][i]=len(p[i],p[j]);
			}
		}
		scanf("%d",&m);
		int x,y;
		for(int i=1;i<=m;i++)
		{
			scanf("%d %d",&x,&y);
			G[x][y]=G[y][x]=-1;
		}
		prime(n);
		for(int i=2;i<=n;i++)
		{
			if(dis[i].len>0)
				printf("%d %d\n",i,dis[i].v);
		}
	}
	return 0;
}