POJ 1679 The Unique MST（求最小生成树是否唯一）

The Unique MST

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 20430		Accepted: 7186

Description

Given a connected undirected graph, tell if its minimum spanning tree is unique. 

Definition 1 (Spanning Tree): Consider a connected, undirected graph G = (V, E). A spanning tree of G is a subgraph of G, say T = (V', E'), with the following properties: 
1. V' = V. 
2. T is connected and acyclic. 

Definition 2 (Minimum Spanning Tree): Consider an edge-weighted, connected, undirected graph G = (V, E). The minimum spanning tree T = (V, E') of G is the spanning tree that has the smallest total cost. The total cost of T means the sum of the weights on all the edges in E'. 

Input

The first line contains a single integer t (1 <= t <= 20), the number of test cases. Each case represents a graph. It begins with a line containing two integers n and m (1 <= n <= 100), the number of nodes and edges. Each of the following m lines contains a triple (xi, yi, wi), indicating that xi and yi are connected by an edge with weight = wi. For any two nodes, there is at most one edge connecting them.

Output

For each input, if the MST is unique, print the total cost of it, or otherwise print the string 'Not Unique!'.

Sample Input

2
3 3
1 2 1
2 3 2
3 1 3
4 4
1 2 2
2 3 2
3 4 2
4 1 2

Sample Output

3
Not Unique!


先求一次最小生成树，然后枚举边，如果去掉这条边的最小生成树价值和原来一样，则不唯一。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <string>
#include <iomanip>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
using namespace std;
struct Node{
    int u, v, w;
}node[110*110/2];
int t, n, m, sum1, sum2,  ans1, ans2;
int pre[110], mark[110*110/2];
int find(int x){
    if(pre[x] == x) return x;
    else return find(pre[x]);
}
bool cmp(Node x, Node y){
    return x.w < y.w;
}

int main(){
    scanf("%d", &t);
    while(t--){
        scanf("%d%d", &n, &m);
        for(int i = 1; i <= m; i++){
            scanf("%d%d%d", &node[i].u, &node[i].v, &node[i].w);
        }
        sort(node+1,node+1+m,cmp);
        sum1 = 0;
        ans1 = 0;
        for(int i = 1; i <= n; i++) pre[i] = i;
        for(int i = 1; i <= m; i++){
            if(ans1 == n-1) break;
            int aa = find(node[i].u);
            int bb = find(node[i].v);
            if(aa != bb){
                sum1 += node[i].w;
                pre[aa] = bb;
                mark[++ans1] = i;
            //    ans++;
            }
        }
        bool flag = true;
        for(int k = 1; k <= ans1; k++){
            for(int i = 1; i <= n; i++) pre[i] = i;
            sum2 = 0; ans2 = 0;
            for(int i = 1; i <= m; i++){
                if(i == mark[k]) continue;
                if(ans2 == n-1) break;
                int aa = find(node[i].u);
                int bb = find(node[i].v);
                if(aa != bb){
                    sum2 += node[i].w;
                    pre[aa] = bb;
                    ans2++;
                }
            }
            if(ans2 == n-1 && sum2 == sum1){
                flag = false; break;
            }
        }
        if(flag) printf("%d
", sum1);
        else printf("Not Unique!
");
        
        

    }
    
    return 0;
}