[BZOJ3669][LCT]NOI2014：魔法森林

BZOJ3669

LCT板子题吧
用类似于kruscal的想法，先对a排序加边，然后每次加入如果连通了两个连通块就直接加
如果已经连通就查询一下原来的路径上的最大值删去就好
如果某一步操作下1和n已经连通就更新答案

Code：

#include<bits/stdc++.h>
using namespace std;
inline int read(){
	int res=0,f=1;char ch=getchar();
	while(!isdigit(ch)) {if(ch=='-') f=-f;ch=getchar();}
	while(isdigit(ch)) {res=(res<<1)+(res<<3)+(ch^48);ch=getchar();}
	return res*f;
}
const int N=2e5+5;
int a[N<<1];
namespace LCT{
	struct S{int ls,rs,rev,fa,id;}tr[N<<1];
	#define rs(x) tr[x].rs
	#define ls(x) tr[x].ls
	#define fa(x) tr[x].fa
	#define rev(x) tr[x].rev
	#define id(x) tr[x].id
	int que[N<<1];
	inline int isrs(int x){return rs(fa(x))==x;}
	inline bool isroot(int x){
		if(!fa(x)) return true;
		return ls(fa(x))!=x && rs(fa(x))!=x;
	}
	inline void pushup(int x){
		id(x)=x;
		if(a[id(ls(x))]>a[id(x)]) id(x)=id(ls(x));
		if(a[id(rs(x))]>a[id(x)]) id(x)=id(rs(x));
	}
	inline void pushdown(int x){
		if(rev(x)){
			swap(ls(x),rs(x));
			if(ls(x)) rev(ls(x))^=1;
			if(rs(x)) rev(rs(x))^=1;
			rev(x)=0;
		}
	}
	inline void rotate(int x){
		int y=fa(x),z=fa(y),b=ls(y)==x?rs(x):ls(x);
		if(z && !isroot(y)) (ls(z)==y?ls(z):rs(z))=x;
		fa(x)=z;fa(y)=x;b?fa(b)=y:0;
		if(ls(y)==x) rs(x)=y,ls(y)=b;
		else ls(x)=y,rs(y)=b;
		pushup(y);pushup(x);
	}
	inline void splay(int x){
		que[que[0]=1]=x;
		for(int y=x;!isroot(y);y=fa(y)) que[++que[0]]=fa(y);
		for(int i=que[0];i;i--) pushdown(que[i]);
		while(!isroot(x)){
			if(!isroot(fa(x))){
				if(isrs(x)==isrs(fa(x))) rotate(fa(x));
				else rotate(x);
			}
			rotate(x);
		}
		pushup(x);
	}
	inline void access(int x){
		for(int y=0;x;y=x,x=fa(x)){
			splay(x);rs(x)=y;pushup(x);
			if(y) fa(y)=x;
		}
	}
	inline int findroot(int x){
		access(x);splay(x);
		while(pushdown(x),ls(x)) x=ls(x);
		splay(x);return x;
	}
	inline void makeroot(int x){access(x);splay(x);rev(x)^=1;}
	inline void link(int x,int y){makeroot(x);fa(x)=y;}
	inline void cut(int x,int y){makeroot(x);access(y);splay(y);fa(x)=ls(y)=0;pushup(y);}
	inline int ask(int x,int y){makeroot(x);access(y);splay(y);return id(y);}
}
using namespace LCT;
struct E{int x,y,z1,z2;}e[N];
inline bool cmp(E a,E b){if(a.z1==b.z1) return a.z2<b.z2;return a.z1<b.z1;}
int n,m;
int ff[N];
int get(int v){return v==ff[v]?v:ff[v]=get(ff[v]);}
const int INF=1e9;
int main(){
	n=read();m=read();int ans=INF;
	for(int i=1;i<=n;i++) ff[i]=i;
	for(int i=1;i<=m;i++) e[i].x=read(),e[i].y=read(),e[i].z1=read(),e[i].z2=read();
	sort(e+1,e+m+1,cmp);
	for(int i=1;i<=m;i++){
		int xx=get(e[i].x),yy=get(e[i].y);
		int x=e[i].x,y=e[i].y;
		if(xx==yy){
			int w=ask(x,y);
			if(a[w]<=e[i].z2) continue;
			cut(w,e[w-n].x);cut(w,e[w-n].y);
		}
		else ff[xx]=yy;
		a[n+i]=e[i].z2;id(n+i)=n+i;
		link(x,n+i);link(y,n+i);
		if(get(1)==get(n)) ans=min(ans,e[i].z1+a[ask(1,n)]);
	}
	if(ans==INF) puts("-1");
	else cout<<ans;
	return 0;
}