畅通工程再续 （kruskal算法的延续）

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<vector>
 5 #include<cmath>
 6 #include<iomanip>
 7 #include<algorithm>
 8 using namespace std;
 9 const long long maxa=99999999;
10 int m;
11 struct place
12 {
13     double a;
14     double b;
15 
16 }P[105];
17 double gets(place x,place y)
18 {
19     return sqrt((x.a-y.a)*(x.a-y.a)+(x.b-y.b)*(x.b-y.b));
20 
21 }
22 struct village
23 {
24     int v;
25     int e;
26     double w;
27     village(int x,int y,double z){
28             v=x,e=y,w=z;
29     }
30     village(){}
31     bool operator <(const village &V)const
32     {
33         return w<V.w;
34 
35     }
36 
37 };
38 vector<village> V;
39 int book[105];
40 void init()
41 {
42     for(int i=1;i<=m;i++)
43         book[i]=i;
44 
45 }
46 int getx(int x)
47 {
48     if(book[x]!=x)
49         book[x]=getx(book[x]);
50     return book[x];
51 }
52 void mergexy(int x,int y)
53 {
54      book[y]=x;
55 }
56 void getvillage()
57 {
58     for(int i=1;i<=m;i++)
59          for(int j=i+1;j<=m;j++)
60               V.push_back(village(i,j,gets(P[i],P[j])));
61 }
62 int main()
63 {
64     int t;
65     cin>>t;
66     while(t--)
67     {
68         V.clear();
69         cin>>m;
70          int x,y;
71          for(int i=1;i<=m;i++)
72             scanf("%lf%lf",&P[i].a,&P[i].b);
73             getvillage();
74         init();
75         sort(V.begin(),V.end());
76         int number=0;
77         double sum=0;
78         for(int i=0;i<V.size();i++)
79         {
80             if(V[i].w>=10&&V[i].w<=1000&&getx(V[i].v)!=getx(V[i].e)){
81                 mergexy(getx(V[i].v),getx(V[i].e));
82                 number++;
83                 sum+=V[i].w;;
84 
85         }
86         if(number==m-1)  break;
87     }
88     sum=sum*100;
89     if(number==m-1) cout<<fixed<<setprecision(1)<<sum<<endl;
90     else cout<<"oh!"<<endl;
91 
92 
93 }
94 return 0;
95 }