pog---1861- Network
2016-05-30 15:04
197 查看
Description
Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since each worker of the company must have access to the whole network,
each hub must be accessible by cables from any other hub (with possibly some intermediate hubs).
Since cables of different types are available and shorter ones are cheaper, it is necessary to make such a plan of hub connection, that the maximum length of a single cable is minimal. There is another problem — not each hub can be connected to any other one
because of compatibility problems and building geometry limitations. Of course, Andrew will provide you all necessary information about possible hub connections.
You are to help Andrew to find the way to connect hubs so that all above conditions are satisfied.
Input
The first line of the input contains two integer numbers: N - the number of hubs in the network (2 <= N <= 1000) and M - the number of possible hub connections (1 <= M <= 15000). All hubs are numbered from 1 to N. The following M lines contain information about
possible connections - the numbers of two hubs, which can be connected and the cable length required to connect them. Length is a positive integer number that does not exceed 10 6. There will be no more than one way to connect two hubs. A hub cannot
be connected to itself. There will always be at least one way to connect all hubs.
Output
Output first the maximum length of a single cable in your hub connection plan (the value you should minimize). Then output your plan: first output P - the number of cables used, then output P pairs of integer numbers - numbers of hubs connected by the corresponding
cable. Separate numbers by spaces and/or line breaks.
Sample Input
Sample Output
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<iostream>
#include<string>
#define N 1100
#define INF 0x3f3f3f3f
using namespace std;
int n,m;
int map
, dis
, vis
;
int prim()
{
int i,j,pos, sum=0,Min;
memset(vis, 0, sizeof(vis));
vis[1]=1;
for(i=1; i<=n; i++)
dis[i]=map[1][i];
for(i=1; i<n; i++)
{
Min=INF;
for(j=1; j<=n; j++)
if(!vis[j]&&dis[j]<Min)
{
Min=dis[j];
pos=j;
}
vis[pos]=1;
sum+=dis[pos];
for(j=1; j<=n; j++)
{
if(!vis[j] && map[j][pos]<dis[j])
dis[j]=map[j][pos];
}
}
return sum;
}
int main()
{
int i, k, x, y, ans;
while(scanf("%d",&n), n)
{
scanf("%d",&m);
memset(map,20000,sizeof(map));
for(i=0; i<m; i++)
{
scanf("%d %d %d",&x, &y, &k);
if(k<map[x][y])
map[x][y]=map[y][x]=k;
}
ans=prim();
printf("%d\n",ans);
}
return 0;
}
Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since each worker of the company must have access to the whole network,
each hub must be accessible by cables from any other hub (with possibly some intermediate hubs).
Since cables of different types are available and shorter ones are cheaper, it is necessary to make such a plan of hub connection, that the maximum length of a single cable is minimal. There is another problem — not each hub can be connected to any other one
because of compatibility problems and building geometry limitations. Of course, Andrew will provide you all necessary information about possible hub connections.
You are to help Andrew to find the way to connect hubs so that all above conditions are satisfied.
Input
The first line of the input contains two integer numbers: N - the number of hubs in the network (2 <= N <= 1000) and M - the number of possible hub connections (1 <= M <= 15000). All hubs are numbered from 1 to N. The following M lines contain information about
possible connections - the numbers of two hubs, which can be connected and the cable length required to connect them. Length is a positive integer number that does not exceed 10 6. There will be no more than one way to connect two hubs. A hub cannot
be connected to itself. There will always be at least one way to connect all hubs.
Output
Output first the maximum length of a single cable in your hub connection plan (the value you should minimize). Then output your plan: first output P - the number of cables used, then output P pairs of integer numbers - numbers of hubs connected by the corresponding
cable. Separate numbers by spaces and/or line breaks.
Sample Input
4 6 1 2 1 1 3 1 1 4 2 2 3 1 3 4 1 2 4 1
Sample Output
1 4 1 2 1 3 2 33 4
#include<stdio.h>
#include<string.h>
#include<ctype.h>
#include<iostream>
#include<string>
#define N 1100
#define INF 0x3f3f3f3f
using namespace std;
int n,m;
int map
, dis
, vis
;
int prim()
{
int i,j,pos, sum=0,Min;
memset(vis, 0, sizeof(vis));
vis[1]=1;
for(i=1; i<=n; i++)
dis[i]=map[1][i];
for(i=1; i<n; i++)
{
Min=INF;
for(j=1; j<=n; j++)
if(!vis[j]&&dis[j]<Min)
{
Min=dis[j];
pos=j;
}
vis[pos]=1;
sum+=dis[pos];
for(j=1; j<=n; j++)
{
if(!vis[j] && map[j][pos]<dis[j])
dis[j]=map[j][pos];
}
}
return sum;
}
int main()
{
int i, k, x, y, ans;
while(scanf("%d",&n), n)
{
scanf("%d",&m);
memset(map,20000,sizeof(map));
for(i=0; i<m; i++)
{
scanf("%d %d %d",&x, &y, &k);
if(k<map[x][y])
map[x][y]=map[y][x]=k;
}
ans=prim();
printf("%d\n",ans);
}
return 0;
}
相关文章推荐
- [持续更新]过SOD检测OD方法
- 布局与控件(三)-TextView那些事儿
- 【C语言】【面试题】C++中String类引用计数器的浅拷贝写法与深拷贝写法
- 【C语言】String类的写时拷贝
- 【C++】模版的概念、使用方法和深入了解
- 【C++】菱形继承与虚拟菱形继承的对比分析
- 【C++】日期类+日期万年历+日期计算器
- U盘装系统教程
- #ifndef 与 #program once 的区别
- 【C++】智能指针的原始写法、scoped写法、shared写法
- 【数据结构】线索化二叉树中序线索化的递归写法和非递归写法
- 【数据结构】堆的实现以及简单的函数
- 【数据结构】用模版实现大小堆、实现优先级队列,以及堆排序
- 【数据结构】【面试题】找N个数据中最大的K个数据
- 【数据结构】位图BitMap与布隆过滤器BloomFilter
- 【linux】linux下find指令的用法总结
- 《将博客搬至CSDN》
- 【Linux】CentOS下vim的配置
- 【转】google play上传应用
- Android图片剪裁-调用系统实现,完美适配魅族等机型