将所有岛之间的距离算出来然后运用最小生成树即可求出
/*
Author: 2486
Memory: 1556 KB Time: 46 MS
Language: G++ Result: Accepted
*/
#include <cstring>
#include <string>
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
const int N=10005;
const double eps=1e-8;
struct edge {
int v,u;
double cost;
friend bool operator <(const edge &a,const edge &b) {
return a.cost<b.cost;
}
} es[N];
struct island {
int x,y;
double cost;
} IsLand[N];
int par[N],ranks[N],n,islandnumber;
void init(int sizes) {
for(int i=0; i<=sizes; i++) {
par[i]=i;
ranks[i]=1;
}
}
int find(int x) {
return par[x]==x?x:par[x]=find(par[x]);
}
bool same(int x,int y) {
return find(x)==find(y);
}
void unite(int x,int y) {
x=find(x);
y=find(y);
if(x==y)return ;
if(ranks[x]>ranks[y]) {
par[y]=x;
} else {
par[x]=y;
if(ranks[x]==ranks[y])ranks[x]++;
}
}
void kruskal(int sizes) {
sort(es,es+sizes);
init(sizes);
double res=0;
int cur=0;
for(int i=0; i<sizes; i++) {
edge e=es[i];
if(!same(e.u,e.v)) {
unite(e.u,e.v);
res+=e.cost;
cur++;
}
}
if(cur==islandnumber-1) {//n个岛屿有n-1条边,所以如果没有n-1条边形成的话,则表明无法连通所有的岛屿
printf("%.1lf\n",res);
} else {
printf("oh!\n");
}
}
int main() {
double temp;
scanf("%d",&n);
while(n--) {
int cur=0;
scanf("%d",&islandnumber);
for(int i=0; i<islandnumber; i++) {
scanf("%d%d",&IsLand[i].x,&IsLand[i].y);
}
for(int i=0; i<islandnumber; i++) {
for(int j=0; j<i; j++) {
//算出每一个岛屿之间的距离
temp=sqrt(double((IsLand[i].x-IsLand[j].x)*(IsLand[i].x-IsLand[j].x)+(IsLand[i].y-IsLand[j].y)*(IsLand[i].y-IsLand[j].y)));
if(temp<10||1000<temp)continue;
es[cur].v=i;
es[cur].u=j;
es[cur++].cost=temp*100.0;
}
}
kruskal(cur);
}
return 0;
}