poj-1751-Highways-(最小生成树)

Highways

he island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has a very poor system of public highways. The Flatopian government is aware of this problem and has already constructed a number of highways connecting some of the most important towns. However, there are still some towns that you can’t reach via a highway. It is necessary to build more highways so that it will be possible to drive between any pair of towns without leaving the highway system.

Flatopian towns are numbered from 1 to N and town i has a position given by the Cartesian coordinates (xi, yi). Each highway connects exaclty two towns. All highways (both the original ones and the ones that are to be built) follow straight lines, and thus their length is equal to Cartesian distance between towns. All highways can be used in both directions. Highways can freely cross each other, but a driver can only switch between highways at a town that is located at the end of both highways.

The Flatopian government wants to minimize the cost of building new highways. However, they want to guarantee that every town is highway-reachable from every other town. Since Flatopia is so flat, the cost of a highway is always proportional to its length. Thus, the least expensive highway system will be the one that minimizes the total highways length.
Input
The input consists of two parts. The first part describes all towns in the country, and the second part describes all of the highways that have already been built.

The first line of the input file contains a single integer N (1 <= N <= 750), representing the number of towns. The next N lines each contain two integers, xi and yi separated by a space. These values give the coordinates of i th town (for i from 1 to N). Coordinates will have an absolute value no greater than 10000. Every town has a unique location.

The next line contains a single integer M (0 <= M <= 1000), representing the number of existing highways. The next M lines each contain a pair of integers separated by a space. These two integers give a pair of town numbers which are already connected by a highway. Each pair of towns is connected by at most one highway.
Output
Write to the output a single line for each new highway that should be built in order to connect all towns with minimal possible total length of new highways. Each highway should be presented by printing town numbers that this highway connects, separated by a space.

If no new highways need to be built (all towns are already connected), then the output file should be created but it should be empty.
Sample Input
9
1 5
0 0
3 2
4 5
5 1
0 4
5 2
1 2
5 3
3
1 3
9 7
1 2
Sample Output
1 6
3 7
4 9
5 7
8 3

题意：有那个点，下面是n个坐标 在后面是已经有道路的，输出需要再建的路。

题解： 这个Kruskal算法是可以过的。

#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
struct node {
    int x,y;
}a[751];

struct node1{
    int x,y;
    double dis;
}b[751*751];

int vis[800];


int find(int a)
{
    if(vis[a]==a)
    return a;
    return vis[a]=find(vis[a]);
}

int mix(int a,int b)
{
    int x=find(a);
    int y=find(b);
    if(x!=y)
    vis[x]=y;
}

bool cmp(node1 a ,node1 b)
{
    return a.dis < b.dis ; 
}

int main()
{
    int n;
    scanf("%d",&n);
    //{
         for(int i=1;i<=n;i++)
         {
            scanf("%d%d",&a[i].x ,&a[i].y );
         } 
         for(int i=1;i<=n;i++)
         vis[i]=i;
         int k;
         scanf("%d",&k);
        // k=k-1;
         int c,d;
         while(k--)
         {
            scanf("%d%d",&c,&d);
            mix(c,d);
         }
         c=0;
         for(int i=1;i<n;i++)
         {
            for(int j=i+1;j<=n;j++)
            {
                b[c].x =i;
                b[c].y =j;
                b[c++].dis =sqrt((a[i].x -a[j].x )*(a[i].x -a[j].x )+(a[i].y -a[j].y )*(a[i].y -a[j].y ));
             }
         }
         sort(b,b+c,cmp);
         for(int i=0;i<c;i++)
         {
            if(find(b[i].x )!=find(b[i].y ))
            {
                printf("%d %d
",b[i].x ,b[i].y );
                mix(b[i].x ,b[i].y );
             }
         }
//  }
    return 0;
}