poj 2349 Arctic Network (prim算法)
来源:互联网 发布:大学生java培训课程 编辑:程序博客网 时间:2024/06/10 04:48
Arctic Network
Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 10525 Accepted: 3470
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.
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
12 40 1000 3000 600150 750
Sample Output
212.13
最小生成树prim算法
#include"stdio.h"#include"math.h"#include"string.h"#include"queue"#include"algorithm"using namespace std;#define N 505const double inf=1e12;double g[N][N],dis[N];bool mark[N];int n,m;struct node{ double x,y;}e[N];double fun(int i,int j){ double x,y; x=e[i].x-e[j].x; y=e[i].y-e[j].y; return sqrt(x*x+y*y);}void prim(int s){ int i,j,u;double min; memset(mark,0,sizeof(mark)); mark[s]=1; for(i=0;i<m;i++) { dis[i]=g[s][i]; }dis[s]=0; for(j=1;j<m;j++) { u=s; min=inf; for(i=0;i<m;i++) { if(!mark[i]&&dis[i]<min) { min=dis[i]; u=i; } } mark[u]=1; for(i=0;i<m;i++) { if(!mark[i]&&dis[i]>g[u][i]) dis[i]=g[u][i]; } } sort(dis,dis+m); //从小到大排序 printf("%.2f\n",dis[m-n]);}int main(){ int T,i,j; scanf("%d",&T); while(T--) { scanf("%d%d",&n,&m); for(i=0;i<m;i++) { scanf("%lf%lf",&e[i].x,&e[i].y); } for(i=0;i<m;i++) { for(j=0;j<i;j++) { g[i][j]=g[j][i]=fun(i,j); } g[i][i]=inf; //注意初始化 } prim(0); } return 0;}
0 0
- poj 2349 Arctic Network (prim算法)
- poj 2349 Arctic Network prim算法做
- POJ 2349 Arctic Network(Prim算法)
- poj 2349 Arctic Network (prim)
- POJ 2349 Arctic Network(Prim)
- POJ 2349 Arctic Network(Prim/Kruskal)
- POJ - 2349----Arctic Network(prim)
- zoj 1914 || poj 2349 Arctic Network(Prim~)
- POJ 2349 Arctic Network 最小生成树 prim && kruscal
- POJ 2349 Arctic Network(最小生成树之Prim)
- POJ 2349 Arctic Network 最小生成树 Prim
- POJ 2349 Arctic Network(最小生成树 kruscal or prim)
- poj 2349 Arctic Network uva 10369(prim or kruscal最小生成树)
- POJ 2349 Arctic Network(Prim,有好多要注意的)
- POJ 2349 Arctic Network
- POJ 2349 Arctic Network
- poj 2349 Arctic Network
- poj 2349 Arctic Network
- addChildViewController
- pl sql 连接oracleTNS-12541: TNS: 无监听程序(缺少tnsnames.ora和listener.ora文件)
- Freemarker_内置函数_数字、字符串、日期格式化
- Git索引
- Binder机制2---Binder的数据结构以及Binder驱动
- poj 2349 Arctic Network (prim算法)
- Spring 在 xml配置文件或annotation注解中运用Spring EL
- Test
- 同步锁--sleep,wait,lock,synchronized
- SyntaxError: Non-ASCII character '\xe7' in file解决方法
- Android性能优化之布局优化
- jQuery 核心函数以及jQuery对象
- android 开源项目收集
- Binder机制1---Binder原理介绍