Network

 Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 16628 Accepted: 6597 Special Judge

Description

<div class=”ptx” lang=”en-US” style=”font-family:”Times New Roman”,Times,serif; font-size:14px”>
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

<div class=”ptx” lang=”en-US” style=”font-family:”Times New Roman”,Times,serif; font-size:14px”>
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 106. 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

<div class=”ptx” lang=”en-US” style=”font-family:”Times New Roman”,Times,serif; font-size:14px”>
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 3
3 4
```

Source

Northeastern Europe 2001, Northern Subregion

kruskal算法：按边权从小到到排序，顺序将边加入图中，若图中两点不连通则加入，否则就不考虑，（判断两点是否在图中中并查集，并查集的主要功能就是合并和查找的功能），最终就可以解答此题，找到最小的边权的连通图。

```#include
#include
#include
#include

using namespace std;

const int maxn = 1e6+7;

int father[maxn];

int n, m, c = 1;
struct _edge{
int x, y, d;
}edge[maxn], ans[maxn];

bool cmp(_edge a, _edge b)
{
return a.d < b.d;
}

int fi(int x)
{
return x == father[x] ? x : father[x] = fi(father[x]);
}

void union1(int x, int y)
{
int p1 = fi(x), p2 = fi(y);
if (p1 == p2) return;
father[p1] = p2;
}

int check(int x, int y)
{
int p = fi(x), q = fi(y);
if (p == q)
return 1;
return 0;
}

void init()
{
for (int i=0; i<=n; i++) father[i]="i;" } void kruskal() { for (int i="1;" i<="m;" int x="edge[i].x;" y="edge[i].y;" if (fi(x) !="fi(y))" union1(x, y); ans[c].x="x;" ans[c].y="y;" ans[c].d="edge[i].d;" c++; main() x, y; scanf("%d%d", &n, &m); init(); scanf("%d%d%d", &edge[i].x, &edge[i].y, &edge[i].d); sort(edge+1, edge+m+1, cmp); kruskal(); printf("%d\n", ans[c-1].d); c-1); i
```

• 本文作者： Fayne
• 本文链接： 348.html
• 版权声明： 本博客所有文章除特别声明外，均采用 CC BY-NC-SA 4.0 许可协议。转载请注明出处！