传送门
lct经典题。
维护动态最小生成树。
具体实现就是把边转化成一个带点权的点,其它的点变成不带点权的点,然后要加入一条边
(
u
,
v
)
(u,v)
(u,v)的话,我们求出路径
(
u
,
v
)
(u,v)
(u,v)上的最大值与该边的边权进行比较,如果替换更优的话就先断掉那条最大的边,然后连上这条边。
代码:
#include<bits/stdc++.h>
#define N 100005
#define M 200005
using namespace std;
inline int read(){
int ans=0;
char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))ans=(ans<<3)+(ans<<1)+(ch^48),ch=getchar();
return ans;
}
int n,m,top,tot=0,Fa[N+M],stk[N+M],fa[N+M],rev[N+M],son[N+M][2],val[N+M],pos[N+M],ans=2e9;
struct edge{int u,v,a,b;}e[M];
inline int max(int a,int b){return a>b?a:b;}
inline int which(int x){return x==son[fa[x]][1];}
inline bool isroot(int x){return !fa[x]||(son[fa[x]][0]!=x&&son[fa[x]][1]!=x);}
inline void pushdown(int p){
if(!rev[p])return;
swap(son[p][0],son[p][1]),rev[p]^=1;
if(son[p][0])rev[son[p][0]]^=1;
if(son[p][1])rev[son[p][1]]^=1;
}
inline void pushup(int p){
pos[p]=p;
if(son[p][0]&&val[pos[son[p][0]]]>val[pos[p]])pos[p]=pos[son[p][0]];
if(son[p][1]&&val[pos[son[p][1]]]>val[pos[p]])pos[p]=pos[son[p][1]];
}
inline void rotate(int x){
int y=fa[x],z=fa[y],t=which(x);
if(z&&!isroot(y))son[z][which(y)]=x;
fa[y]=x,fa[x]=z,son[y][t]=son[x][t^1],son[x][t^1]=y;
if(son[y][t])fa[son[y][t]]=y;
pushup(y),pushup(x);
}
inline void splay(int x){
stk[top=1]=x;
for(int i=x;!isroot(i);i=fa[i])stk[++top]=fa[i];
while(top)pushdown(stk[top--]);
while(!isroot(x)){if(!isroot(fa[x]))rotate(which(x)==which(fa[x])?fa[x]:x);rotate(x);}
}
inline void access(int x){for(int y=0;x;y=x,x=fa[x])splay(x),son[x][1]=y,pushup(x);}
inline void makeroot(int x){access(x),splay(x),rev[x]^=1,pushdown(x);}
inline int findroot(int x){
access(x),splay(x);
while(pushdown(x),son[x][0])x=son[x][0];
return splay(x),x;
}
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),son[y][0]=fa[x]=0,pushup(y);}
inline int find(int x){return x==Fa[x]?Fa[x]:Fa[x]=find(Fa[x]);}
inline bool cmp(edge a,edge b){return a.a==b.a?a.b<b.b:a.a<b.a;}
inline int query(int x,int y){return makeroot(x),access(y),splay(y),pos[y];}
int main(){
n=read(),m=read(),tot=0;
for(int i=1;i<=m;++i)e[i].u=read(),e[i].v=read(),e[i].a=read(),e[i].b=read();
for(int i=1;i<=n+m;++i)Fa[i]=i,val[i]=0,pos[i]=i;
sort(e+1,e+m+1,cmp);
for(int i=1;i<=m;++i)val[i+n]=e[i].b;
for(int i=1;i<=m;++i){
int fx=find(e[i].u),fy=find(e[i].v);
if(fx==fy){
int w=query(e[i].u,e[i].v);
if(val[w]>e[i].b)cut(e[w-n].u,w),cut(w,e[w-n].v),link(e[i].u,i+n),link(i+n,e[i].v);
}
else Fa[fx]=fy,link(e[i].u,i+n),link(i+n,e[i].v);
if(find(1)==find(n))ans=min(ans,e[i].a+val[query(1,n)]);
}
printf("%d",ans==2e9?-1:ans);
return 0;
}