PKU3625Prime

最新推荐文章于 2023-09-24 17:29:34 发布

ZCR_7

最新推荐文章于 2023-09-24 17:29:34 发布

阅读量503

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/ZCR_7/article/details/37828949

版权

ACM 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

原题 http://poj.org/problem?id=3625

//题目中说明了有些路是已经连好的。所以要将这些路的距离变为0.然后prime

#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include <ctype.h>
#include <malloc.h>
#include <string.h>
#include <string>
#include <algorithm>
#include <iostream>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <vector>
#include <map>
#include <math.h>
using namespace std;
#define INF 999999999.9
#define N 1111
int X[N],Y[N];
double dis[N][N];
int vis[N];
double g[N];
int n,m;
double sum;

double len(int x1,int y1,int x2,int y2){
	double c;
	c = sqrt((x1-x2+0.0)*(x1-x2+0.0)+(y1-y2+0.0)*(y1-y2+0.0));//一定要+0.0
	return c;
}

void Prime(){
	int mark = 2;
	int i,j;
	for(i=1;i<=n;i++){
		g[i] = dis[1][i];
	}
	vis[1] = 1;
	double tmp;
	//double sum=0;
	int k;
	for(i=1;i<=n;i++){
		tmp = INF;
		for(j=1;j<=n;j++){
			if(tmp>g[j] && vis[j]==0){
				tmp = g[j];
				k = j;
			}
		}
		if(tmp == INF){
			mark = 1;
			break;
		}
		else{
			vis[k] = 1;
			sum+=tmp;
			for(j=1;j<=n;j++){
				if(vis[j]==0 && dis[k][j]<g[j]){
					g[j] = dis[k][j];
				}
			}
		}
	}
	//printf("%.2lf\n",sum);
}

int main(){
	int i;

	while(~scanf("%d%d",&n,&m)){
		memset(vis,0,sizeof(vis));
		memset(g,0,sizeof(g));
		for(i=1;i<=n;i++){
			scanf("%d%d",&X[i],&Y[i]);
		}
		int j;
		for(i=1;i<=n;i++){
			dis[i][i] = 0;
			for(j=1;j<=i;j++){
				dis[i][j] = len(X[i],Y[i],X[j],Y[j]);
				dis[j][i] = dis[i][j];
			}
		}
		int a,b;
		for(i=0;i<m;i++){
			scanf("%d%d",&a,&b);
			dis[a][b] = 0;
			dis[b][a] = 0;
		}
		sum = 0;
		Prime();
		printf("%.2lf\n",sum);
	}

	return 0;
}