UVA 1395Slim Span
来源:互联网 发布:阿里云服务器登录账号 编辑:程序博客网 时间:2024/06/05 15:17
Description
Given an undirected weighted graph G, you should find one of spanning trees specified as follows.
The 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).
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 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.
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.
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 ek. wk is a positive integer less than or equal to 10000, which indicates the weight of ek. 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).
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 51 2 31 3 51 4 62 4 63 4 74 61 2 101 3 1001 4 902 3 202 4 803 4 402 11 2 13 03 11 2 13 31 2 22 3 51 3 65 101 2 1101 3 1201 4 1301 5 1202 3 1102 4 1202 5 1303 4 1203 5 1104 5 1205 101 2 93841 3 8871 4 27781 5 69162 3 77942 4 83362 5 53873 4 4933 5 66504 5 14225 81 2 12 3 1003 4 1004 5 1001 5 502 5 503 5 504 1 1500 0
Sample Output
1200-1-110168650
按边排序然后暴力做最小生成树就好了。
#include<cmath>#include<queue>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;#define ms(x,y) memset(x,y,sizeof(x))#define rep(i,j,k) for(int i=j;i<=k;i++)#define loop(i,j,k) for (int i=j;i!=-1;i=k[i])#define inone(x) scanf("%d",&x)#define intwo(x,y) scanf("%d%d",&x,&y)#define inthr(x,y,z) scanf("%d%d%d",&x,&y,&z)#define lson x<<1,l,mid#define rson x<<1|1,mid+1,rconst int N = 1e5+ 10;const int INF = 0x7FFFFFFF;int n, m, fa[N];int x[N], y[N], z[N], a[N];int get(int x) { return x == fa[x] ? x : fa[x] = get(fa[x]); }int main(){while (intwo(n, m), n + m){rep(i, 1, m) inthr(x[i], y[i], z[i]), a[i] = i;sort(a + 1, a + m + 1, [] (int u, int v) {return z[u] < z[v]; });int ans = INF;rep(i, 1, m) {rep(j, 1, n) fa[j] = j;int cnt = n - 1;rep(j, i, m) {int fx = get(x[a[j]]), fy = get(y[a[j]]);if (fx == fy) continue;fa[fx] = fy; if (!--cnt){ ans = min(ans, z[a[j]] - z[a[i]]);break;}}if (cnt) break;}printf("%d\n", ans == INF ? -1 : ans);}return 0;}
- UVA 1395 Slim Span
- 【UVA】1395-Slim Span
- UVA 1395 - Slim Span
- UVA - 1395 Slim Span
- UVa 1395 Slim Span
- UVA 1395 Slim Span
- UVa 1395 slim span
- UVA 1395 Slim Span
- UVA 1395 Slim Span
- UVA 1395Slim Span
- uva 1395Slim Span
- uva 1395 Slim Span
- Uva 1395 Slim Span
- UVA 1395 Slim Span(枚举)
- uva 1395 slim span MST
- UVA 1395 - Slim Span(MST)
- UVa #1395 Slim Span (例题11-2)
- UVa 1395 - Slim Span(MST)
- #note#priority_queue的cmp对象写法
- 关于this指向的理解
- C#导出excel文件
- Unable to execute dex: Multiple dex files define 解决方法
- Linux命令---处理文件最常用命令
- UVA 1395Slim Span
- 打造炫酷通用的ViewPager指示器 - 玩转字体变色
- svn服务端,客户端安装,以及使用。
- jdbc
- varchar和Nvarchar区别
- angularjs自定义指令
- error LNK2005: "void __cdecl operator delete(void *)" (??3@YAXPAX@Z) already defined in LIBCMTD.lib
- PXE
- 数据结构实验之排序二-冒泡与快排