POJ  3625  Building Roads

Building Roads

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 6392		Accepted: 1842

Description

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 (X_i, Y_i) on the plane (0 ≤ X_i ≤ 1,000,000; 0 ≤ Y_i ≤ 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.

Input

* Line 1: Two space-separated integers: N and M
* Lines 2..N+1: Two space-separated integers: X_i and Y_i 
* 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.

Output

* 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.

Sample Input

4 1 

1 1 

3 1 

2 3 

4 3 

1 4

Sample Output

4.00

Source

USACO 2007 December Silver

发现做题真是极度考验心理承受能力，明明结果对，却非得转换一下数据类型用sqrt的时候请注意了，具体格式见我的代码：

#include<stdio.h>

#include<math.h>

double map[1008][1008],num;

int x[1008],y[1008],n;

double Distance(int i,int j)

{

        return sqrt((x[i]-x[j]+0.0)*(x[i]-x[j]+0.0)+(y[i]-y[j]+0.0)*(y[i]-y[j]+0.0));

}

void Prime()

{

        int flag[1008],dir[1008],i,j,k;

        double lenth[1008],min;

        for(i=1;i<=n;i++)

        {

         dir[i]=i;

         flag[i]=0;

         lenth[i]=map[1][i];

        }

        flag[1]=1;

        for(i=1;i<=n;i++)

        {

         min=100000000.0;

         for(j=1;j<=n;j++)

         if(flag[j]==0&&lenth[j]<min)

         {

         min=lenth[j];

         k=j;

         }

         if(min==100000000.0)break;

         flag[k]=1;

         num+=min;

         for(j=1;j<=n;j++)

         if(flag[j]==0&&lenth[j]>map[k][j])

         lenth[j]=map[k][j];

        }

}

int main()

{

        int m,i,j,a,b;

        while(scanf("%d%d",&n,&m)!=EOF)

        {

         for(i=1;i<=n;i++)

         scanf("%d%d",&x[i],&y[i]);

       for(i=1;i<=n;i++)

         {

         map[i][i]=0;

         for(j=1;j<i;j++)

         map[i][j]=map[j][i]=Distance(i,j);

         }

         for(i=1;i<=m;i++)

         {

         scanf("%d%d",&a,&b);

         map[a][b]=map[b][a]=0;

         }

                num=0;

                Prime();

            printf("%.2lf\n",num);

    }

    return 0;

}