这题需要注意的一点:这这些空间单元中 , 可能有些单元是重叠或是接触的 , 那么它们之间的距离就是0
调用并查集时尽量优化
代码:
int n;
double xy[110][4];
int p[110] ;
int rank[110];
struct node
{
int u , v;
double w;
}edge[10010];
bool cmp(node x , node y)
{
return x.w <= y.w;
}
void init()
{
for(int i = 0; i < n; i++)
p[i] = i;
memset(rank , 0 , sizeof(rank));
}
double dist(int i , int j)
{
double x = xy[i][0]-xy[j][0] , y = xy[j][1]-xy[i][1] , z = xy[i][2]-xy[j][2];
return sqrt(x*x+y*y+z*z);
}
int find(int x)
{
int g = x , h;
while(x != p[x])
x = p[x];
while(p[g] != x)
{
h = p[g];
p[g] = x;
g = h;
}
return x;
}
int Union(int x , int y)
{
int a = find(x) , b = find(y);
if(a == b)
return 0;
if(rank[a] == rank[b])
p[a] = b , rank[b] += 1;
else if(rank[a] < rank[b])
p[a] = b;
else p[b] = a;
return 1;
}
int main()
{
while(scanf("%d" , &n) && n)
{
init();
int i , j;
for(i = 0; i < n; i++)
scanf("%lf %lf %lf %lf" , &xy[i][0] , &xy[i][1] , &xy[i][2] , &xy[i][3]);
int m = 0;
double s;
for(i = 0; i < n; i++)
for(j = i+1; j < n; j++)
{
s = dist(i , j)-(xy[i][3]+xy[j][3]);
if(s <= 0.000001)
{
edge[m].u = i , edge[m].v = j;
edge[m].w = 0.0;
m += 1;
}
else
{
edge[m].u = i , edge[m].v = j;
edge[m].w = s;
m += 1;
}
}
sort(edge , edge+m , cmp);
int k = 0;
s = 0;
for(i = 0; i < m; i++)
{
j = Union(edge[i].u , edge[i].v);
if(j)
s += edge[i].w;
}
printf("%.3lf\n" , s);
}
return 0;
}
调用并查集时尽量优化
代码:
int n;
double xy[110][4];
int p[110] ;
int rank[110];
struct node
{
}edge[10010];
bool cmp(node x , node y)
{
}
void init()
{
}
double dist(int i , int j)
{
}
int find(int x)
{
}
int Union(int x , int y)
{
}
int main()
{
}