bzoj2594

题解：

lct维护最小生成树

首先，先对于每一条边，生成一个点，这个点连接这一条边的两个端点

点的值为边的权值

其他点的权值都是0

那么每一次查找i-j路径上面最小值，就变成查找树上路径点权最小值

按照最小生成树的方法来生成这一刻lct

然后先把所有要删去的边删掉，后面再一条一条加上去

代码：

#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
const int N=;
int n,m,Q,top,f[N],fa[N],c[N][],s[N],mx[N],val[N],rev[N];
struct edge{int u,v,w,id,d;}e[N/];
struct que{int f,x,y,ans,id;}q[N/];
int operator<(edge a,edge b){return a.u<b.u||(a.u==b.u&&a.v<b.v);}
int cmp(edge a,edge b){return a.w<b.w;}
int cmp2(edge a,edge b){return a.id<b.id;}
int getf(int x){return x==f[x]?x:f[x]=getf(f[x]);}
int find(int u,int v)
{
    int l=,r=m;
    while (l<r)
     {
        int mid=(l+r)/;
        if (e[mid].u<u||(e[mid].u==u&&e[mid].v<v))l=mid+;
        else r=mid;
     }
    return l;
}
int isroot(int x){return c[fa[x]][]!=x&&c[fa[x]][]!=x;}
void update(int x)
{
    int l=c[x][],r=c[x][];mx[x]=x;
    if(val[mx[l]]>val[mx[x]])mx[x]=mx[l];
    if(val[mx[r]]>val[mx[x]])mx[x]=mx[r];
}
void rotate(int x)
{
    int y=fa[x],z=fa[y],l,r;
    if(c[y][]==x)l=;else l=;r=l^;
    if (!isroot(y))
      {
        if (c[z][]==y)c[z][]=x;
        else c[z][]=x;
     }
    fa[x]=z;fa[y]=x;fa[c[x][r]]=y;
    c[y][l]=c[x][r];c[x][r]=y;
    update(y);update(x);
}
void pushdown(int x)
{
    int l=c[x][],r=c[x][];
    if (rev[x])
     {
        rev[x]^=;rev[l]^=;rev[r]^=;
        swap(c[x][],c[x][]);
     }
}
void down(int x)
{
    if (!isroot(x))down(fa[x]);
    pushdown(x);
}
void splay(int x)
{
    down(x);
    for (int y=fa[x];!isroot(x);rotate(x),y=fa[x])
     if (!isroot(y))rotate((c[y][]==x)==(c[fa[y]][]==y)?y:x);
}
void access(int x)
{
    int t=;
    while (x)
     {
        splay(x);
        c[x][]=t;
        update(x);
        t=x;x=fa[x];
     }
}
void makeroot(int x){access(x);splay(x);rev[x]^=;}
void link(int x,int y){makeroot(x);fa[x]=y;}
void cut(int x,int y){makeroot(x);access(y);splay(y);c[y][]=fa[x]=;}
int query(int x,int y){makeroot(x);access(y);splay(y);return mx[y];}
int read()
{
    int x=;char c;
    for (;c<''||c>'';c=getchar());
    for (;c>=''&&c<='';c=getchar())x=x*+c-;
    return x;
}
int main()
{
    n=read();m=read();Q=read();
    for (int i=;i<=n;i++)f[i]=i;
    for (int i=;i<=m;i++)
     {
        e[i].u=read(),e[i].v=read(),e[i].w=read();
        if (e[i].u>e[i].v)swap(e[i].u,e[i].v);
     }
    sort(e+,e+m+,cmp);
    for (int i=;i<=m;i++)
     {
        e[i].id=i;
        val[n+i]=e[i].w;
        mx[n+i]=n+i;
     }
    sort(e+,e+m+);
    for (int i=;i<=Q;i++)
     {
        q[i].f=read(),q[i].x=read(),q[i].y=read();
        if (q[i].f==)
         {
            if(q[i].x>q[i].y)swap(q[i].x,q[i].y);
            int t=find(q[i].x,q[i].y);
            e[t].d=;q[i].id=e[t].id;
         }
     }
    sort(e+,e+m+,cmp2);
    int tot=;
    for (int i=;i<=m;i++)
     if (!e[i].d)
      {
         int u=e[i].u,v=e[i].v,x=getf(u),y=getf(v);
        if (x!=y)
         {
             f[x]=y;
            link(u,i+n);
            link(v,i+n);
         }
      }
    for (int i=Q;i;i--)
     {
         int u=q[i].x,v=q[i].y,k=q[i].id;
        if(q[i].f==)q[i].ans=val[query(u,v)];
        else
         {
            int t=query(u,v);
            if(e[k].w<val[t])
             {
                cut(e[t-n].u,t);cut(e[t-n].v,t);
                link(u,k+n);link(v,k+n);
             }
         }
     }
    for (int i=;i<=Q;i++)
     if (q[i].f==)printf("%d\n",q[i].ans);
    return ;
}