P2872 [USACO07DEC]Building Roads S

题目描述

Farmer John had just acquired several new farms! He wants to connect the farms with roads so that he can travel from any farm to any other farm via a sequence of roads; roads already connect some of the farms.

Each of the N (1 ≤ N ≤ 1,000) farms (conveniently numbered 1..N) is represented by a position (Xi, Yi) on the plane (0 ≤ Xi ≤ 1,000,000; 0 ≤ Yi ≤ 1,000,000). Given the preexisting M roads (1 ≤ M ≤ 1,000) as pairs of connected farms, help Farmer John determine the smallest length of additional roads he must build to connect all his farms.

给定 n 个点的坐标，第 i 个点的坐标为(xi​,yi​)，这 n 个点编号为 1 到 n。给定m 条边，第 i 条边连接第 ui​ 个点和第 vi​ 个点。现在要求你添加一些边，并且能使得任意一点都可以连通其他所有点。求添加的边的总长度的最小值。

输入格式

* Line 1: Two space-separated integers: N and M

* Lines 2..N+1: Two space-separated integers: Xi and Yi

* Lines N+2..N+M+2: Two space-separated integers: i and j, indicating that there is already a road connecting the farm i and farm j.

第一行两个整数 n,m 代表点数与边数。
接下来 n 行每行两个整数 xi​,yi​ 代表第i 个点的坐标。
接下来 m 行每行两个整数 ui​,vi​ 代表第 i 条边连接第ui​ 个点和第vi​ 个点。

输出格式

* Line 1: Smallest length of additional roads required to connect all farms, printed without rounding to two decimal places. Be sure to calculate distances as 64-bit floating point numbers.

一行一个实数代表添加的边的最小长度，要求保留两位小数，为了避免误差， 请用 64 位实型变量进行计算。

输入输出样例

输入 #1

4 1
1 1
3 1
2 3
4 3
1 4

输出 #1

4.00

说明/提示

数据规模与约定

对于 100% 的整数，10001≤n,m≤1000，10^6≤xi​,yi​≤10^6

 

模板题

 

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn=3005;
struct point
{
	int x,y;
}a[maxn];
struct edge
{
	int x,y;
	double d;
}e[maxn*maxn];
int n,m,cnt,f[maxn],ax,bx,flag[maxn][maxn];
double dis[maxn][maxn];
int find(int x)
{
	if(x==f[x]) return x ;
	return f[x]=find(f[x]);
}
bool cmp(edge aa,edge bb)
{
	return aa.d<bb.d;
}
int main()
{
	freopen("P2872_2.in","r",stdin);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
		scanf("%d%d",&a[i].x,&a[i].y),f[i]=i;
	for(int i=1;i<=n;i++)	
		for(int j=1;j<=n;j++)
		{
			dis[i][j]=dis[j][i]=sqrt(1LL*(a[i].x-a[j].x)*(a[i].x-a[j].x)+1LL*(a[i].y-a[j].y)*(a[i].y-a[j].y));
			e[++cnt].x=i; e[cnt].y=j;
			e[cnt].d=dis[i][j];
		}
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d",&ax,&bx);
		int fa=find(ax);
		int fb=find(bx);
		f[fa]=fb;
		flag[ax][bx]=flag[bx][ax]=1;
	}
	sort(e+1,e+cnt+1,cmp);
	double ans=0;
	int tot=0;
	for(int i=1;i<=cnt;i++)
	{
		if(flag[e[i].x][e[i].y]) continue;
		int fa=find(e[i].x);
		int fb=find(e[i].y);
		if(fa==fb) continue;
		f[fa]=fb;
		ans+=e[i].d;
		tot++;
		if(tot==n-m-1) break;
	}
	printf("%.2lf",ans);
	return 0;
}

注意：计算两点间距离时，要转换longlong，会炸int！！！