poj 2349(最小生成树)

Arctic Network

Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5359 Accepted: 1901

Description

The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost will have a radio transceiver and some outposts will in addition have a satellite channel. 
Any two outposts with a satellite channel can communicate via the satellite, regardless of their location. Otherwise, two outposts can communicate by radio only if the distance between them does not exceed D, which depends of the power of the transceivers. Higher power yields higher D but costs more. Due to purchasing and maintenance considerations, the transceivers at the outposts must be identical; that is, the value of D is the same for every pair of outposts. 

Your job is to determine the minimum D required for the transceivers. There must be at least one communication path (direct or indirect) between every pair of outposts.

Input

The first line of input contains N, the number of test cases. The first line of each test case contains 1 <= S <= 100, the number of satellite channels, and S < P <= 500, the number of outposts. P lines follow, giving the (x,y) coordinates of each outpost in km (coordinates are integers between 0 and 10,000).

Output

For each case, output should consist of a single line giving the minimum D required to connect the network. Output should be specified to 2 decimal points.

Sample Input

12 40 1000 3000 600150 750

Sample Output

212.13

Source

Waterloo local 2002.09.28

题目类型：最小生成树

题目描述：略

题目分析：先求最小生成树，然后找第S大的边。

代码如下：

#include <iostream>#include <algorithm>#include <stdio.h>#include <math.h>#define V 501using namespace std;struct Point{    int x;    int y;};Point p[V];double map[V][V];int n;double edge[V];double key[V];bool visit[V];bool cmp(double a,double b){    if( a > b){        return true;    } else {        return false;    }}double jl(Point a,Point b){    return sqrt( double((a.x - b.x) * ( a.x - b.x ) + ( a.y - b.y) * (a.y -b.y)) );}int keyMin(){    double min = 10001;    int pos = -1;    for(int i = 0; i < n ; i++){        if( !visit[i] && key[i] < min){            min = key[i];            pos = i;        }    }    return pos;}void update(int p){    for(int i = 0; i < n; i++){        if(!visit[i]){            if( map[p][i] < key[i]){                key[i] = map[p][i];            }        }    }}void prim(){    memset(visit,false,sizeof(visit));    visit[0] = true;    for(int i = 0 ; i < n; i++){        key[i] = map[0][i];    }    for(int i = 0; i <= n-2; i++){        int pos = keyMin();        edge[i] = key[pos];        visit[pos] = true;        update(pos);    }}int main(){    int t,s;    scanf("%d",&t);    while(t--){        scanf("%d%d",&s,&n);        for(int i = 0; i < n; i++){            int x,y;            scanf("%d%d",&x,&y);            p[i].x = x;            p[i].y = y;            for(int j = 0; j < i; j++){                map[j][i] = jl(p[j],p[i]);                map[i][j] = jl(p[i],p[j]);            }        }        prim();        sort(edge,edge+n-1,cmp);        printf("%.2lf\n",edge[s-1]);    }    return 0;}