/*
原来超时,在①处加上上届即可。英文表示很吃力啊。。。
*/
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
const int cMax = 107;
const double INF = 1000;
struct Co
{
int x;
int y;
}co[cMax];
struct Dis
{
int u, v;
double dis;
Dis(){dis = INF + 1;}
Dis(int u, int v, double dis):u(u),v(v),dis(dis){}
}diss[cMax * cMax];
int e;//①
int p[cMax];
int C;
int cmp(const void *a, const void *b)
{
Dis *pa = (Dis *) a;
Dis *pb = (Dis *) b;
return pa->dis > pb->dis ? 1 : -1;
}
int cmp1(const void *a, const void *b)
{
Co *pa = (Co *) a;
Co *pb = (Co *) b;
return pa->x - pb->x;
}
void init()
{
scanf("%d", &C);
int i, j;
for(i = 0; i < C; ++ i)
scanf("%d %d", &co[i].x, &co[i].y);
e = 0;
for(i = 0; i < C; ++ i)
for(j = i + 1; j < C; ++ j)
{
double x = sqrt((double)(co[j].x - co[i].x) * (co[j].x - co[i].x) + (double)(co[j].y - co[i].y) * (co[j].y - co[i].y));
if(x >= 10 && x <= 1000)
diss[e ++] = Dis(i, j, x);
}
qsort(diss, e, sizeof(diss[0]), cmp);
for(i = 0; i < C; ++ i)
p[i] = i;
}
int find(int x)
{
return p[x] == x ? x : p[x] = find(p[x]);
}
bool isConn()
{
int i;
bool ok = true;
for(i = 1; i < C; ++ i)
if(find(0) != find(i))
{
ok = false;
break;
}
return ok;
}
int main()
{
//freopen("f://data.in", "r", stdin);
int T;
scanf("%d", &T);
while(T -- )
{
init();
int i;
double ans = 0;
for(i = 0; i < e; ++ i)
{
int x = find(diss[i].u);
int y = find(diss[i].v);
if(x != y)
{
p[x] = y;
ans += diss[i].dis;
}
}
if(isConn())
printf("%.1lf\n", ans * 100);
else
printf("oh!\n");
}
return 0;
}
HDU 1875 畅通工程再续
最新推荐文章于 2020-11-18 15:42:05 发布