畅通工程再续
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 21573 Accepted Submission(s): 6811
Problem Description
相信大家都听说一个“百岛湖”的地方吧,百岛湖的居民生活在不同的小岛中,当他们想去其他的小岛时都要通过划小船来实现。现在政府决定大力发展百岛湖,发展首先要解决的问题当然是交通问题,政府决定实现百岛湖的全畅通!经过考察小组RPRush对百岛湖的情况充分了解后,决定在符合条件的小岛间建上桥,所谓符合条件,就是2个小岛之间的距离不能小于10米,也不能大于1000米。当然,为了节省资金,只要求实现任意2个小岛之间有路通即可。其中桥的价格为 100元/米。
Input
输入包括多组数据。输入首先包括一个整数T(T <= 200),代表有T组数据。
每组数据首先是一个整数C(C <= 100),代表小岛的个数,接下来是C组坐标,代表每个小岛的坐标,这些坐标都是 0 <= x, y <= 1000的整数。
每组数据首先是一个整数C(C <= 100),代表小岛的个数,接下来是C组坐标,代表每个小岛的坐标,这些坐标都是 0 <= x, y <= 1000的整数。
Output
每组输入数据输出一行,代表建桥的最小花费,结果保留一位小数。如果无法实现工程以达到全部畅通,输出”oh!”.
Sample Input
2 2 10 10 20 20 3 1 1 2 2 1000 1000
Sample Output
1414.2 oh!
Author
8600
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn = 10000 + 5;
const double INF = 10000;
double e[maxn][maxn];
double dis[maxn];
int flag[maxn];
struct Edge
{
int x,y;
};
Edge edge[maxn];
int main()
{
int T,C,i,j;
scanf("%d",&T);
while(T--)
{
scanf("%d",&C);
for(i = 1 ; i <= C; i++)
scanf("%d%d",&edge[i].x,&edge[i].y);
for(i = 1 ; i <= C; i++)
for(j = 1 ; j <= C; j++)
if(i == j) e[i][j] = 0.0;
else e[i][j] = INF;
for(i = 1 ; i < C;i++)
for(j = i + 1 ; j <= C; j++)
{
e[i][j] = sqrt((edge[j].y-edge[i].y)*(edge[j].y-edge[i].y) + (edge[j].x-edge[i].x)*(edge[j].x-edge[i].x));
e[j][i] = e[i][j];
if(e[i][j] < 10||e[i][j] > 1000)
{
e[i][j] = INF;
e[j][i] = INF;
}
}
for(i = 1 ;i <= C; i++)
{
dis[i] = e[1][i];
flag[i] = 0;
}
int xxx=0;
double sum = 0;
for(i = 1;i <= C;i++)
{
int x;
double minn = INF;
for(j = 1;j <= C;j++)
{
if(!flag[j]&& dis[j] <= minn)
minn = dis[x = j];
}
if(dis[x] == INF)
{
xxx=1;
break;
}
flag[x] = 1;
sum += dis[x];
for(j = 1; j <= C ; j++)
{
if(!flag[j] && e[x][j] < dis[j])
dis[j] = e[x][j];
}
}
if(xxx) printf("oh!\n");
else
{
sum *= 100;
printf("%.1lf\n",sum);
}
}
return 0;
}
#include <cstdio>
#include <cmath>
using namespace std;
const int maxn = 10000 + 5;
const double INF = 10000;
double e[maxn][maxn];
double dis[maxn];
int flag[maxn];
struct Edge
{
int x,y;
};
Edge edge[maxn];
int main()
{
int T,C,i,j;
scanf("%d",&T);
while(T--)
{
scanf("%d",&C);
for(i = 1 ; i <= C; i++)
scanf("%d%d",&edge[i].x,&edge[i].y);
for(i = 1 ; i <= C; i++)
for(j = 1 ; j <= C; j++)
if(i == j) e[i][j] = 0.0;
else e[i][j] = INF;
for(i = 1 ; i < C;i++)
for(j = i + 1 ; j <= C; j++)
{
e[i][j] = sqrt((edge[j].y-edge[i].y)*(edge[j].y-edge[i].y) + (edge[j].x-edge[i].x)*(edge[j].x-edge[i].x));
e[j][i] = e[i][j];
if(e[i][j] < 10||e[i][j] > 1000)
{
e[i][j] = INF;
e[j][i] = INF;
}
}
for(i = 1 ;i <= C; i++)
{
dis[i] = e[1][i];
flag[i] = 0;
}
int xxx=0;
double sum = 0;
for(i = 1;i <= C;i++)
{
int x;
double minn = INF;
for(j = 1;j <= C;j++)
{
if(!flag[j]&& dis[j] <= minn)
minn = dis[x = j];
}
if(dis[x] == INF)
{
xxx=1;
break;
}
flag[x] = 1;
sum += dis[x];
for(j = 1; j <= C ; j++)
{
if(!flag[j] && e[x][j] < dis[j])
dis[j] = e[x][j];
}
}
if(xxx) printf("oh!\n");
else
{
sum *= 100;
printf("%.1lf\n",sum);
}
}
return 0;
}