POJ 3522 Slim Span

Description

Given an undirected weighted graph G, you should find one of spanning trees specified as follows.

The graph G is an ordered pair (VE), where V is a set of vertices {v1, v2, …, vn} and E is a set of undirected edges {e1, e2, …, em}. Each edge e ∈ E has its weight w(e).

A spanning tree T is a tree (a connected subgraph without cycles) which connects all the n vertices with n − 1 edges. The slimness of a spanning tree T is defined as the difference between the largest weight and the smallest weight among the n − 1 edges of T.


Figure 5: A graph G and the weights of the edges

For example, a graph G in Figure 5(a) has four vertices {v1, v2, v3, v4} and five undirected edges {e1, e2, e3, e4, e5}. The weights of the edges are w(e1) = 3, w(e2) = 5, w(e3) = 6, w(e4) = 6, w(e5) = 7 as shown in Figure 5(b).


Figure 6: Examples of the spanning trees of G

There are several spanning trees for G. Four of them are depicted in Figure 6(a)~(d). The spanning tree Ta in Figure 6(a) has three edges whose weights are 3, 6 and 7. The largest weight is 7 and the smallest weight is 3 so that the slimness of the tree Ta is 4. The slimnesses of spanning trees TbTc and Td shown in Figure 6(b), (c) and (d) are 3, 2 and 1, respectively. You can easily see the slimness of any other spanning tree is greater than or equal to 1, thus the spanning tree Td in Figure 6(d) is one of the slimmest spanning trees whose slimness is 1.

Your job is to write a program that computes the smallest slimness.

Input

The input consists of multiple datasets, followed by a line containing two zeros separated by a space. Each dataset has the following format.

n m  
a1 b1 w1
   
am bm wm

Every input item in a dataset is a non-negative integer. Items in a line are separated by a space. n is the number of the vertices and m the number of the edges. You can assume 2 ≤ n ≤ 100 and 0 ≤ m ≤ n(n − 1)/2. ak and bk (k = 1, …, m) are positive integers less than or equal to n, which represent the two vertices vak and vbk connected by the kth edge ekwk is a positive integer less than or equal to 10000, which indicates the weight of ek. You can assume that the graph G = (VE) is simple, that is, there are no self-loops (that connect the same vertex) nor parallel edges (that are two or more edges whose both ends are the same two vertices).

Output

For each dataset, if the graph has spanning trees, the smallest slimness among them should be printed. Otherwise, −1 should be printed. An output should not contain extra characters.

Sample Input

4 5
1 2 3
1 3 5
1 4 6
2 4 6
3 4 7
4 6
1 2 10
1 3 100
1 4 90
2 3 20
2 4 80
3 4 40
2 1
1 2 1
3 0
3 1
1 2 1
3 3
1 2 2
2 3 5
1 3 6
5 10
1 2 110
1 3 120
1 4 130
1 5 120
2 3 110
2 4 120
2 5 130
3 4 120
3 5 110
4 5 120
5 10
1 2 9384
1 3 887
1 4 2778
1 5 6916
2 3 7794
2 4 8336
2 5 5387
3 4 493
3 5 6650
4 5 1422
5 8
1 2 1
2 3 100
3 4 100
4 5 100
1 5 50
2 5 50
3 5 50
4 1 150
0 0

Sample Output

1
20
0
-1
-1
1
0
1686
50

题解:首先对边权升序排序,第一个for循环从小到大枚举MST的最小边权,第二个for循环从小到大枚举MST的最大边权;当所有点联通时存储最大边权-最小边权;

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 110;
const int INF= 1000000000;
int F[maxn];
int n,m;
struct Edge{
 int x,y,w;
}edge[maxn*maxn];
void init()
{
        for (int i = 0;i < n; i++) F[i] = i;
}
int Find(int x)
{
        if(F[x]==x) return x;
        return F[x] = Find(F[x]);
}
bool cmp(Edge p,Edge q) {return p.w < q.w;}
int main()
{
        while(scanf("%d%d",&n, &m) != EOF)
        {
                if(n == 0 && m == 0) break;
                for (int i = 0;i < m;i++)
                {

                        scanf("%d%d%d",&edge[i].x,&edge[i].y,&edge[i].w);
                }
                sort(edge,edge+m,cmp);
                int ans=INF;
                for (int i = 0;i <=m - n + 1 ;i++)
                {
                         init();
                         int cnt=0,temp=-1;
                        for (int j = i;j < m;j++)
                        {
                                int xroot=Find(edge[j].x),yroot =Find(edge[j].y);
                                if(xroot != yroot)
                                {
                                        F[xroot] = yroot;
                                        cnt ++;
                                        if(cnt == n-1)
                                        {
                                                temp = edge[j].w - edge[i].w;
                                                break;
                                        }
                                }

                        }
                        if(temp != -1 && temp < ans) ans=temp;
                }
                if(ans<INF) printf("%d\n",ans);
                else printf("-1\n");
        }
}

 

阅读更多

Slim Span

12-01

Given an undirected weighted graph G, you should find one of spanning trees specified as follows.nnThe graph G is an ordered pair (V, E), where V is a set of vertices v1, v2, …, vn and E is a set of undirected edges e1, e2, …, em. Each edge e ∈ E has its weight w(e).nnA spanning tree T is a tree (a connected subgraph without cycles) which connects all the n vertices with n − 1 edges. The slimness of a spanning tree T is defined as the difference between the largest weight and the smallest weight among the n − 1 edges of T.nnnFigure 5: A graph G and the weights of the edgesnFor example, a graph G in Figure 5(a) has four vertices v1, v2, v3, v4 and five undirected edges e1, e2, e3, e4, e5. The weights of the edges are w(e1) = 3, w(e2) = 5, w(e3) = 6, w(e4) = 6, w(e5) = 7 as shown in Figure 5(b).nnnFigure 6: Examples of the spanning trees of GnThere are several spanning trees for G. Four of them are depicted in Figure 6(a)~(d). The spanning tree Ta in Figure 6(a) has three edges whose weights are 3, 6 and 7. The largest weight is 7 and the smallest weight is 3 so that the slimness of the tree Ta is 4. The slimnesses of spanning trees Tb, Tc and Td shown in Figure 6(b), (c) and (d) are 3, 2 and 1, respectively. You can easily see the slimness of any other spanning tree is greater than or equal to 1, thus the spanning tree Td in Figure 6(d) is one of the slimmest spanning trees whose slimness is 1.nnYour job is to write a program that computes the smallest slimness.nnInputnnThe input consists of multiple datasets, followed by a line containing two zeros separated by a space. Each dataset has the following format.nnn m na1 b1 w1n ⋮ nam bm wmnEvery input item in a dataset is a non-negative integer. Items in a line are separated by a space. n is the number of the vertices and m the number of the edges. You can assume 2 ≤ n ≤ 100 and 0 ≤ m ≤ n(n − 1)/2. ak andbk (k = 1, …, m) are positive integers less than or equal to n, which represent the two vertices vak and vbk connected by the kth edge ek. wk is a positive integer less than or equal to 10000, which indicates the weight ofek. You can assume that the graph G = (V, E) is simple, that is, there are no self-loops (that connect the same vertex) nor parallel edges (that are two or more edges whose both ends are the same two vertices).nnOutputnnFor each dataset, if the graph has spanning trees, the smallest slimness among them should be printed. Otherwise, −1 should be printed. An output should not contain extra characters.nnSample Inputnn4 5n1 2 3n1 3 5n1 4 6n2 4 6n3 4 7n4 6n1 2 10n1 3 100n1 4 90n2 3 20n2 4 80n3 4 40n2 1n1 2 1n3 0n3 1n1 2 1n3 3n1 2 2n2 3 5n1 3 6n5 10n1 2 110n1 3 120n1 4 130n1 5 120n2 3 110n2 4 120n2 5 130n3 4 120n3 5 110n4 5 120n5 10n1 2 9384n1 3 887n1 4 2778n1 5 6916n2 3 7794n2 4 8336n2 5 5387n3 4 493n3 5 6650n4 5 1422n5 8n1 2 1n2 3 100n3 4 100n4 5 100n1 5 50n2 5 50n3 5 50n4 1 150n0 0nSample Outputnn1n20n0n-1n-1n1n0n1686n50

换一批

没有更多推荐了,返回首页