pog---1861- Network


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. 


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 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 2
1 3
2 3

3 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[N][N], dis[N], vis[N]; 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; }

版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/qq_35030023/article/details/51538122
个人分类: 最小生成树
想对作者说点什么? 我来说一句

network 2222

2008年09月16日 500B 下载

network 网络流 network 网络流

2010年07月21日 27KB 下载

network in network 基于caffe的实现

2015年01月08日 1KB 下载



pog---1861- Network