沉迷Link-Cut tree无法自拔之：[BZOJ2594][Wc2006]水管局长数据加强版

//made by Hero_of_Someone
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#define N (100010)
#define M (1000010)
#define RG register
using namespace std;
inline int gi(){ RG int x=0; RG char ch=getchar(); while(ch<'0'||ch>'9') ch=getchar();
  while('0'<=ch&&ch<='9') x=(x<<3)+(x<<1)+ch-'0',ch=getchar(); return x; }

int n,m,q;
struct Edge{ 
  int u,v,w; 
  bool operator<(const Edge&a)const{ 
    return u==a.u?v<a.v:u<a.u; 
  }
  bool operator<(const pair<int,int>& a)const{
    return u==a.first?v<a.second:u<a.first;
  }
}e[M];

struct Que{ int op,x,y; }Q[N];

//-----------------------------------------------------------
int Fa[N];
inline int Find(RG int x){ return Fa[x]==x?x:Fa[x]=Find(Fa[x]); }

struct EEE{
  int u,v,w,id;
  bool operator<(const EEE& a)const{ return w<a.w; }
  void operator=(const Edge& a){
    u=a.u,v=a.v,w=a.w,id=(&a)-e;
  }
}E[M];

int num,head[N],nxt[N<<1],to[N<<1],w[N<<1]; //w为该边原来的编号
inline void add(int u,int v,int d){
  nxt[++num]=head[u];to[num]=v;w[num]=d;head[u]=num;
  nxt[++num]=head[v];to[num]=u;w[num]=d;head[v]=num;
}

bool v[M];
inline void kruskal(){
  RG int top=0;
  for(RG int i=1;i<=n;i++) Fa[i]=i;
  for(RG int i=1;i<=m;i++){
    if(v[i]) continue;
    E[++top]=e[i];
  }
  sort(E+1,E+top+1);
  for(RG int i=1;i<=top;i++){
    RG int x=E[i].u,y=E[i].v;
    RG int fx=Find(x),fy=Find(y);
    if(fx==fy) continue;
    Fa[fx]=fy; add(x,y,E[i].id);
  }
}

inline void init(){
  n=gi(),m=gi(),q=gi();
  for(RG int i=1;i<=m;i++){
    e[i].u=gi(),e[i].v=gi(),e[i].w=gi();
  }
  sort(e+1,e+m+1);
  for(RG int i=1;i<=q;i++){
    Q[i].op=gi(),Q[i].x=gi(),Q[i].y=gi();
    if(Q[i].op==2){
      RG int V=lower_bound(e+1,e+m+1,make_pair(Q[i].x,Q[i].y))-e;
      Q[i].x=V; v[V]=1;
    }
  }q++;
  kruskal();
}
//---------------------------------------------------------------

int val[N+M],Max[N+M];
int ch[N+M][2],fa[N+M],rev[N+M];

inline void cur(int x,int y){ val[x]=Max[x]=y; }

int vis[N];
inline void dfs(RG int x,RG int f,RG int d){
  if(vis[x]) return ;
  vis[x]=1; cur(x,0);
  if(f){ cur(n+d,d); fa[n+d]=f; fa[x]=n+d; } //将边转换成点插入树中
  for(RG int i=head[x];i;i=nxt[i])
    dfs(to[i],x,w[i]);
}

inline bool cnm(int x,int y){ return e[x].w<e[y].w; }
inline void up(int x){
  Max[x]=max(Max[ch[x][0]],Max[ch[x][1]],cnm);
  Max[x]=max(Max[x],val[x],cnm);
}

inline void reverse(int x){
  swap(ch[x][0],ch[x][1]);
  rev[x]^=1;
}

inline void down(int x){
  if(!rev[x]) return ;
  reverse(ch[x][0]);
  reverse(ch[x][1]);
  rev[x]=0;
}

inline bool is_root(int x){ return ch[fa[x]][0]!=x && x!=ch[fa[x]][1]; }

inline bool lr(int x){ return x==ch[fa[x]][1]; }

inline void rotate(int x){
  RG int y=fa[x],z=fa[y],k=lr(x);
  if(!is_root(y)) ch[z][lr(y)]=x;
  fa[x]=z; fa[ch[x][k^1]]=y; fa[y]=x;
  ch[y][k]=ch[x][k^1]; ch[x][k^1]=y;
  up(y); up(x);
}

int st[N+M];
inline void splay(int x){
  RG int y=x,top=0;
  while(1){
    st[++top]=y;
    if(is_root(y)) break;
    y=fa[y];
  }
  for(RG int i=top;i;i--) down(st[i]);
  while(!is_root(x)){
    if(!is_root(fa[x])) rotate(lr(x)^lr(fa[x])?x:fa[x]);
    rotate(x);
  }
}

inline void access(int x){
  RG int y=0;
  while(x){ splay(x);
    ch[x][1]=y; fa[y]=x;
    up(x); y=x; x=fa[x];
  }
}

inline void make_root(int x){
  access(x); splay(x); reverse(x);
}

inline int query(int x,int y){
  make_root(x); access(y); splay(y);
  return Max[y];
}

inline int find(int x){
  while(fa[x]) x=fa[x];
  return x;
}

inline void link(int x,int y){
  if(find(x)==find(y)) return ;
  make_root(x); fa[x]=y;
}

inline void cut(int x,int y){
  make_root(x); access(y); splay(y);
  if(ch[y][0]==x) ch[y][0]=0,fa[x]=0,up(y);
}

inline void Insert(int id){
  RG int x=e[id].u,y=e[id].v;
  if(find(x)==find(y)){
    RG int tmp=query(x,y);
    if(e[tmp].w<=e[id].w) return ;
    cut(n+tmp,e[tmp].u);
    cut(n+tmp,e[tmp].v);
  }
  cur(n+id,id);
  link(x,n+id);
  link(y,n+id);
}

int Ans[N],top;
inline void work(){
  for(RG int i=1;i<=n;i++) dfs(i,0,0);
  while(--q){
    if(Q[q].op==2) Insert(Q[q].x);
    else Ans[++top]=e[query(Q[q].x,Q[q].y)].w;
  }
  for(RG int i=top;i;i--) printf("%d\n",Ans[i]);
}

int main(){ init(); work(); return 0; }