POJ 3625（朴素prim）

这道题没什么特殊的，输入n组坐标，需要自己建图。然后又有m组意思是a到b可以不用建路。

但是因为输出要用到double或者float，G++中输出用%f，C++用%lf。很神奇。

#include<cstdio>
#include<cstring>
#include<cmath>

#define Max 1010

class Node
{
public:
    double x,y;
}c[Max];

double distance(double ax,double ay,double bx,double by)
{
    double dx = ax - bx;
    double dy = ay - by;
    return sqrt(dx*dx + dy*dy);
}

double gragh[Max][Max];
double dis[Max];
int visit[Max];
int n,m;

double prim()
{
    double sum = 0;
    memset(visit,0,sizeof(visit));
    for(int i = 1;i <= n; i++){
        dis[i] = gragh[1][i];
    }
    visit[1] = true;
    int pos;
    for(int i = 1;i < n; i++){
        double Min = 999999999;
        for(int j = 1;j <= n; j++){
            if(visit[j] == 0 && dis[j] < Min){
                Min = dis[j];
                pos = j;
            }
        }
        sum += dis[pos];
        visit[pos] = true;
        for(int j = 1;j <= n; j++){
            if(visit[j] == 0 && dis[j] > gragh[pos][j]){
                dis[j] = gragh[pos][j];
            }
        }
    }
    return sum;
}

int main()
{
    //freopen("in.txt","r",stdin);
    scanf("%d%d",&n,&m);
    for(int i = 1;i <= n; i++)
        scanf("%lf%lf",&c[i].x,&c[i].y);
    for(int i = 1;i <= n; i++)
        for(int j = 1;j <= n; j++){
            gragh[i][j] = distance(c[i].x,c[i].y,c[j].x,c[j].y);
        }
    int s,e;
    for(int i = 1;i <= n; i++){
        scanf("%d%d",&s,&e);
        gragh[s][e] = 0;
        gragh[e][s] = 0;
    }
    double ans = prim();
    printf("%.2f\n",ans);
    return 0;
}