POJ - 1679 The Unique MST （次小生成树） 板子

题目链接

题意：让你判断最小生成树的值是不是唯一的。

思路：就是说若是存在次小生成树的值与最小生成树相同， 以前都喜欢用倍增法实现查出在最小生成树添加新边后环上最大权值的边，现在改用dfs复杂度少去一个logn。

 

///                 .-~~~~~~~~~-._       _.-~~~~~~~~~-.
///             __.'              ~.   .~              `.__
///           .'//                  \./                  \\`.
///        .'//                     |                     \\`.
///       .'// .-~"""""""~~~~-._     |     _,-~~~~"""""""~-. \\`.
///     .'//.-"                 `-.  |  .-'                 "-.\\`.
///   .'//______.============-..   \ | /   ..-============.______\\`.
/// .'______________________________\|/______________________________`.
//#pragma GCC optimize("Ofast")
#pragma comment(linker, "/STACK:102400000,102400000")
//#pragma GCC target(sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx) 
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;

#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
#define fi first
#define se second
typedef long long LL;
typedef pair <int, int> ii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e3+5;
const int maxx=1e7+10;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}

inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}

void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;

struct edge {
	int x,y;
	int cost,vis;
}Q[maxn*maxn],q[maxn*maxn];
ii p[maxn];
int Map[maxn][maxn],dis[maxn][maxn];
int vis[maxn];
int n,m;
int fa[maxn];
int ans,cnt1,val,ans1;
void init() {
	for(int i=0;i<=n;i++) fa[i]=i;
	me(Map,INF);
	me(dis,0);
}
int fi(int x) {
	return fa[x]==x?x:fa[x]=fi(fa[x]);
}
void unio(int x,int y) {
	int p1=fi(x),p2=fi(y);
	if(p1!=p2) fa[p1]=p2;
}
bool cmp(edge a,edge b) {
	return a.cost<b.cost;
}
void Kru() {
	sort(Q+1,Q+m+1,cmp);
	int sum=0;
	for(int i=1;i<=m;i++) {
		if(fi(Q[i].x)==fi(Q[i].y)) continue;
		sum++;
		unio(Q[i].x,Q[i].y);
		ans+=Q[i].cost;
		Map[Q[i].x][Q[i].y]=Map[Q[i].y][Q[i].x]=Q[i].cost;
		p[++cnt1]={Q[i].x,Q[i].y};
		Q[i].vis=1;
		if(sum>=n-1) break;
	}
}

void dfs(int cur,int v,int val) {
	vis[v]=1;
	dis[cur][v]=val;
	//cout<<dis[cur][v]<<endl;
	FOR(1,n,i) {
		if(vis[i]) continue;
		if(Map[v][i]!=INF) dfs(cur,i,max(val,Map[v][i]));
	}
}
void solve() {
	s_2(n,m);
	init();
	ans=0,cnt1=0;
	FOR(1,m,i) {
		int u,v,c;
		s_3(u,v,c);
		Q[i]={u,v,c,0};
	}
	sort(Q+1,Q+m+1,cmp);
	FOR(1,m-1,i) {
		if((Q[i].x==Q[i+1].x&&Q[i].y==Q[i+1].y&&Q[i].cost==Q[i+1].cost)||
			(Q[i].x==Q[i+1].y&&Q[i].y==Q[i+1].x&&Q[i].cost==Q[i+1].cost)) {
			puts("Not Unique!");
			return ;
		}
	}
	Kru();
	FOR(1,n,i) {
		me(vis,0);
		dfs(i,i,0);
	}
	int f=0;
	FOR(1,m,i) {
		if(Q[i].vis) continue;
		//cout<<dis[Q[i].x][Q[i].y]<<endl;
		if(Q[i].cost==dis[Q[i].x][Q[i].y]) f=1;
	}
	if(f) puts("Not Unique!");
	else print(ans);	
}
int main() { 
    //freopen( "1.in" , "r" , stdin );
    //freopen( "1.out" , "w" , stdout );
    int t=1;
    //init();
    s_1(t);
    for(int cas=1;cas<=t;cas++) {
        //printf("Case #%d: ",cas);
        solve();
    }
}