洛谷P2872 [USACO07DEC]Building Roads S
(一个最小生成树,小菜鸟卡了一个半小时)
#include <bits/stdc++.h>
using namespace std;
const int N = 1010 , M = N * N * 2 ;
int n , m ;
int find_all[N];
struct node //存储的坐标
{
long long a, b;
}all[N];
struct nod // 存储点和距离
{
long long a , b , w;
}arr[M];
bool cmp(nod a , nod b )
{
if(a.w != b.w ) return a.w <b.w ;
return true;
}
int find(int a)//并查集
{
if(find_all[a] != a) find_all[a] = find(find_all[a]);
return find_all[a];
}
int main()
{
cin>>n>>m;
long long a , b ;
for(int i = 0 ; i < n; i ++ )//读取坐标
{
cin>>a>>b;
//cout<<a<<" "<<b<<endl;
all[i] = {a , b };
}
int k = 0;
for(long long i = 0 ; i < n ; i ++)//将坐标转为点和距离
{
for(long long j = i+1 ; j < n ; j ++)
{
long long t = (all[i].a -all[j].a )*(all[i].a -all[j].a ) + (all[i].b - all[j].b )*(all[i].b - all[j].b );//这里用longlong 存后边在加pow转一下
arr[k++] = {i + 1 , j + 1 , t };//存一遍就够了
}
}
sort(arr , arr + k ,cmp);//排序
for(int i = 1 ; i <= n ; i ++ ) find_all[i] = i;//初始化
while(m --)
{
cin>>a>>b;
find_all[find(a) ]= find(b); //将已经连好的两个点放在一起
}
double res = 0 ;
for(int i = 0 ; i < k ; i ++)
{
long long x = arr[i].a , y =arr[i].b ,z = arr[i].w ;
if(find(x) != find(y))//如果有点没有在集合里
{
//cout<<x<<" "<<y<<endl;
res += pow(z,0.5);
find_all[find(x)] = find(y);
}
}
printf("%.2lf",res);
return 0;
}