畅通工程再续

  1 #include <iostream>
  2 using namespace std;
  3 #include<string.h>
  4 #include<set>
  5 #include<stdio.h>
  6 #include<math.h>
  7 #include<queue>
  8 #include<map>
  9 #include<algorithm>
 10 #include<cstdio>
 11 #include<cmath>
 12 #include<cstring>
 13 #include <cstdio>
 14 #include <cstdlib>
 15 #include<cstring>
 16 int n;
 17 int a[110];
 18 int lenTM;
 19 struct lll
 20 {
 21     double x,y;
 22 }qqq[110];
 23 struct aaa
 24 {
 25     int x,y;
 26     double len;
 27 }TM[110];
 28 int cmp(aaa a,aaa b)
 29 {
 30     return a.len<b.len;
 31 }
 32 int find(int n)
 33 {
 34     if(a[n]==n)
 35         return n;
 36     else
 37         return a[n]=find(a[n]);
 38 }
 39 int  duzhi(int n,int m)
 40 {
 41     int n1=find(n);
 42     int m1=find(m);
 43     if(n1!=m1)
 44     {
 45         a[m1]=n1;
 46         return 0;
 47     }
 48     else
 49         return 1;
 50 }
 51 struct cmp1{
 52     bool operator ()(aaa &a,aaa &b){
 53         return a.len>b.len;//最小值优先
 54     }
 55 };
 56 priority_queue<aaa,vector<aaa>,cmp1>s;
 57 int main()
 58 {
 59     int t;
 60     cin>>t;
 61     while(t--)
 62     {
 63         memset(a,0,sizeof(a));
 64         memset(qqq,0,sizeof(qqq));
 65         memset(TM,0,sizeof(TM));
 66         cin>>n;
 67         for(int i=1;i<=n;i++)
 68         {
 69             cin>>qqq[i].x>>qqq[i].y;
 70             a[i]=i;
 71         }
 72         lenTM=0;
 73         for(int i=1;i<=n;i++)
 74         {
 75             for(int j=1;j<=n;j++)
 76             {
 77                 if(i==j)
 78                     continue;
 79                 TM[lenTM].x=i;
 80                 TM[lenTM].y=j;
 81                 TM[lenTM].len=sqrt(pow(qqq[i].x-qqq[j].x,2)+pow(qqq[i].y-qqq[j].y,2));
 82                 s.push(TM[lenTM]);
 83             }
 84         }
 85         double sum=0;
 86         while(!s.empty())
 87         {
 88             if(s.top().len<10||s.top().len>1000)
 89             {
 90                 s.pop();
 91             }
 92             else if(duzhi(s.top().x,s.top().y))
 93             {
 94                 s.pop();
 95             }
 96             else
 97             {
 98                 sum+=s.top().len;
 99                 s.pop();
100             }
101 
102         }
103         int add=0;
104         for(int i=1;i<=n;i++)
105             {
106                 if(a[i]==i)
107                     add++;
108             }
109             if(add==1)
110                 printf("%.1lf\n",sum*100);
111         else
112             cout<<"oh!"<<endl;
113     }
114     return 0;
115 }