题目链接: Building Roads
题意
需要把每个农场联结起来,输入每个农场的坐标,以及告诉你哪些农场之间已经连起来了,需要你计算最小的还需要修的路程。
思路
只是简单的最小生成树,但是需要注意精度问题,可以用double 存 农场的坐标。 还要注意G++ 里double的输出是printf("%.2f"),而不是%.2lf。
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <queue>
#include <math.h>
using namespace std;
double dist[1001],a[1001][1001];
const double inf = 0x3f3f3f3f;
int vis[1010];
int n;
double prim()
{
vis[1] = 1;
int index;
for(int i = 1; i <= n; ++i)
dist[i] = a[1][i];
dist[1] = 0;
double sum = 0;
for(int i = 2; i <= n; ++i)
{
double miner = inf;
for(int j = 1; j <= n ; ++j)
{
if(!vis[j] && dist[j] < miner){
miner = dist[j];
index = j;
}
}
vis[index] = 1;
sum += dist[index];
for(int j = 1; j <= n ; ++j)
{
if(!vis[j] && dist[j] > a[index][j])
{
dist[j] = a[index][j];
}
}
}
return sum;
}
int main()
{
int m,A,B;
double x[1001],y[1001];
while(cin >> n >> m)
{
for(int i = 1; i <= n; ++i)
{
cin >> x[i] >> y[i];
}
memset(a,inf,sizeof(a));
memset(dist,inf,sizeof(dist));
memset(vis,0,sizeof(vis));
for(int i = 1; i <= n; ++i)
{
for(int j = i + 1; j <= n ; ++j)
{
a[i][j] = a[j][i] = sqrt((x[j] - x[i])*(x[j] - x[i]) + (y[j] - y[i])* (y[j] - y[i]));
}
}
for(int i = 1; i <= m ; ++i)
{
cin >> A >> B;
a[A][B] = a[B][A] = 0;
}
for(int i = 1; i <= n; ++i)
a[i][i] = 0;
printf("%.2f\n",prim());
}
}