POJ 2349 Arctic Network 【最小生成树变形】
2016-07-29 17:38
369 查看
Description
The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost
will have a radio transceiver and some outposts will in addition have a satellite channel.
Any two outposts with a satellite channel can communicate via the satellite, regardless of their location. Otherwise, two outposts can communicate by radio only if the distance between them does not exceed D, which depends of the power of the transceivers.
Higher power yields higher D but costs more. Due to purchasing and maintenance considerations, the transceivers at the outposts must be identical; that is, the value of D is the same for every pair of outposts.
Your job is to determine the minimum D required for the transceivers. There must be at least one communication path (direct or indirect) between every pair of outposts.
Input
The first line of input contains N, the number of test cases. The first line of each test case contains 1 <= S <= 100, the number of satellite channels, and S < P <= 500, the number of outposts. P lines follow,
giving the (x,y) coordinates of each outpost in km (coordinates are integers between 0 and 10,000).
Output
For each case, output should consist of a single line giving the minimum D required to connect the network. Output should be specified to 2 decimal points.
Sample Input
Sample Output
题目解法:在最小生成树添加的边里找个最小的
AC代码:#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define MAXN 555
#define inf 1LL<<60
struct Node
{
int x,y;
} node[MAXN];
double map[MAXN][MAXN];
double lowcost[MAXN];
double dist[MAXN];
bool mark[MAXN];
int n,m;
double Cal(int i,int j)
{
double d1=1.0*(node[i].x-node[j].x)*(node[i].x-node[j].x);
double d2=1.0*(node[i].y-node[j].y)*(node[i].y-node[j].y);
return sqrt(d1+d2);
}
int cmp(const double &p,const double &q)
{
return p>q;
}
double Prim()
{
int cnt=0;
memset(mark,false,sizeof(mark));
for(int i=1; i<=m; i++)
{
lowcost[i]=map[1][i];
}
lowcost[1]=0;
mark[1]=true;
for(int i=1; i<m; i++)
{
double MIN=inf;
int v ;
for(int j=1; j<=m; j++)
{
if(!mark[j]&&lowcost[j]<MIN)
{
MIN=lowcost[j],v=j;
}
}
if(MIN==inf)break;
mark[v]=true;
dist[cnt++]=lowcost[v];
for(int k=1; k<=m; k++)
{
if(!mark[k]&&map[v][k]<lowcost[k])
{
lowcost[k]=map[v][k];
}
}
}
sort(dist,dist+cnt,cmp);
return dist[n-1];
}
int main()
{
int t,a,b;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(int i=1; i<=m; i++)
for(int j=1; j<=m; j++)
map[i][j]=map[j][i]=(i==j?0:inf);
for(int i = 1 ; i<=m; i++)scanf("%d%d",&node[i].x,&node[i].y);
for(int i=1; i<=m; i++)
{
for(int j=1; j<=m; j++)
{
map[i][j]=map[j][i]=Cal(i,j);
}
}
printf("%.2lf\n",Prim());
}
return 0;
}
The Department of National Defence (DND) wishes to connect several northern outposts by a wireless network. Two different communication technologies are to be used in establishing the network: every outpost
will have a radio transceiver and some outposts will in addition have a satellite channel.
Any two outposts with a satellite channel can communicate via the satellite, regardless of their location. Otherwise, two outposts can communicate by radio only if the distance between them does not exceed D, which depends of the power of the transceivers.
Higher power yields higher D but costs more. Due to purchasing and maintenance considerations, the transceivers at the outposts must be identical; that is, the value of D is the same for every pair of outposts.
Your job is to determine the minimum D required for the transceivers. There must be at least one communication path (direct or indirect) between every pair of outposts.
Input
The first line of input contains N, the number of test cases. The first line of each test case contains 1 <= S <= 100, the number of satellite channels, and S < P <= 500, the number of outposts. P lines follow,
giving the (x,y) coordinates of each outpost in km (coordinates are integers between 0 and 10,000).
Output
For each case, output should consist of a single line giving the minimum D required to connect the network. Output should be specified to 2 decimal points.
Sample Input
1 2 4 0 100 0 300 0 600 150 750
Sample Output
212.13
题目解法:在最小生成树添加的边里找个最小的
AC代码:#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define MAXN 555
#define inf 1LL<<60
struct Node
{
int x,y;
} node[MAXN];
double map[MAXN][MAXN];
double lowcost[MAXN];
double dist[MAXN];
bool mark[MAXN];
int n,m;
double Cal(int i,int j)
{
double d1=1.0*(node[i].x-node[j].x)*(node[i].x-node[j].x);
double d2=1.0*(node[i].y-node[j].y)*(node[i].y-node[j].y);
return sqrt(d1+d2);
}
int cmp(const double &p,const double &q)
{
return p>q;
}
double Prim()
{
int cnt=0;
memset(mark,false,sizeof(mark));
for(int i=1; i<=m; i++)
{
lowcost[i]=map[1][i];
}
lowcost[1]=0;
mark[1]=true;
for(int i=1; i<m; i++)
{
double MIN=inf;
int v ;
for(int j=1; j<=m; j++)
{
if(!mark[j]&&lowcost[j]<MIN)
{
MIN=lowcost[j],v=j;
}
}
if(MIN==inf)break;
mark[v]=true;
dist[cnt++]=lowcost[v];
for(int k=1; k<=m; k++)
{
if(!mark[k]&&map[v][k]<lowcost[k])
{
lowcost[k]=map[v][k];
}
}
}
sort(dist,dist+cnt,cmp);
return dist[n-1];
}
int main()
{
int t,a,b;
scanf("%d",&t);
while(t--)
{
scanf("%d%d",&n,&m);
for(int i=1; i<=m; i++)
for(int j=1; j<=m; j++)
map[i][j]=map[j][i]=(i==j?0:inf);
for(int i = 1 ; i<=m; i++)scanf("%d%d",&node[i].x,&node[i].y);
for(int i=1; i<=m; i++)
{
for(int j=1; j<=m; j++)
{
map[i][j]=map[j][i]=Cal(i,j);
}
}
printf("%.2lf\n",Prim());
}
return 0;
}
相关文章推荐
- Intent的显示与隐示 权限的添加
- 关于dispatch_semaphore的使用
- ruby gem passenger依赖关系
- EF下 CodeFirst、DBFirst与ModelFirst分析
- openssl加密与模拟CA签证和颁发
- 关于Linux启动时挂载rootfs的几种方式
- oracle 全文检索创建脚本示例
- 【转】Derivation of the Normal Equation for linear regression
- easy_install - pip
- No command 'mmm' found
- 测试_33
- HDU-5773-The All-purpose Zero-最长上升子序列改写
- Qt的QWaitCondition
- MySQL中NULL和空值对比
- 倒计时
- BZOJ 2763
- 从url下载图片--java与python实现方式比较
- 文章
- hdu 1533 Going Home(最小费用最大流)
- SQL Server中用While循环替代游标(Cursor)的解决方案