[SDOI2018]原题识别

题解：

。。感觉挺烦得 而且我都没有注意到树随机这件事情。。

就写个30分的莫队。。

#include <bits/stdc++.h>
using namespace std;
#define rint register int
#define IL inline
#define rep(i,h,t) for (int i=h;i<=t;i++)
#define dep(i,t,h) for (int i=t;i>=h;i--)
#define me(x) memset(x,0,sizeof(x))
namespace IO{
    char ss[<<],*A=ss,*B=ss;
    IL char gc()
    {
        return A==B&&(B=(A=ss)+fread(ss,,<<,stdin),A==B)?EOF:*A++;
    }
    template<class T>void read(T &x)
    {
        rint f=,c; while (c=gc(),c<||c>) if (c=='-') f=-; x=(c^);
        while (c=gc(),c>&&c<) x=(x<<)+(x<<)+(c^); x*=f;
    }
    char sr[<<],z[]; int Z,CC=-;
    template<class T>void wer(T x)
    {
        if (x<) sr[++CC]='-',x=-x;
        while (z[++Z]=x%+,x/=);
        while (sr[++CC]=z[Z],--Z);
    }
    IL void wer1()
    {
        sr[++CC]=' ';
    }
    IL void wer2()
    {
        sr[++CC]='\n';
    }
    template<class T>IL void mina(T &x,T y) { if (x>y) x=y;}
    template<class T>IL void maxa(T &x,T y) { if (x<y) x=y;}
    template<class T>IL T MIN(T x,T y){return x<y?x:y;}
    template<class T>IL T MAX(T x,T y){return x>y?x:y;}
};
using namespace IO;
unsigned int SA, SB, SC;
unsigned int rng61(){
    SA ^= SA << ;
    SA ^= SA >> ;
    SA ^= SA << ;
    unsigned int t = SA;
    SA = SB;
    SB = SC;
    SC ^= t ^ SA;
    return SC;
}
const int N=4.1e5;
int l,head[N],n,m,c[N];
struct re{
    int a,b,c,d;
}e[N],a[N];
IL void arr(int x,int y)
{
    e[++l].a=head[x];
    e[l].b=y;
    head[x]=l;
}
IL void addedge(int x,int y)
{
    arr(x,y); arr(y,x);
}
int p;
void gen(){
    cin>>n>>p>>SA>>SB>>SC;
    l=; me(head);
        for(int i = ; i <= p; i++)
    addedge(i - , i);
    for(int i = p + ; i <= n; i++)
    addedge(rng61() % (i - ) + , i);
    for(int i = ; i <= n; i++)
    c[i] = rng61() % n + ;
}
int cnt,dfn1[N],dfn2[N],dep[N],block,num,pos[N];
int bz[][N],ans[N],jl[N],ans2,po[N],b[N];
void dfs(int x,int y)
{
    bz[][x]=y; dep[x]=dep[y]+; dfn1[x]=++cnt;
    b[cnt]=x;
    for (rint u=head[x];u;u=e[u].a)
    {
        int v=e[u].b;
        if (v!=y) dfs(v,x);
    }
    dfn2[x]=++cnt; b[cnt]=x;
}
void change(int x,int k)
{
    x=b[x]; int o;
    jl[x]+=k;
    if (jl[x]==) o=; else o=-;
    if (ans[c[x]]>) ans2--;
    ans[c[x]]+=o;
    if (ans[c[x]]>) ans2++;
}
int lca(int x,int y)
{
    if (dep[x]<dep[y]) swap(x,y);
    dep(i,,)
      if (dep[bz[i][x]]>=dep[y])
        x=bz[i][x];
    if (x==y) return(x);
    dep(i,,)
      if (bz[i][x]!=bz[i][y])
        x=bz[i][x],y=bz[i][y];
    return bz[][x];
}
bool cmp(re x,re y)
{
    int k1=pos[x.a],k2=pos[y.a];
    return k1<k2||(k1==k2&&x.b<y.b);
}
int main()
{
    freopen("1.in","r",stdin);
    freopen("1.out","w",stdout);
    ios::sync_with_stdio(false);
    int T,m;
    cin>>T;
    while (T--)
    {
        me(ans); me(jl); cnt=; ans2=;
        gen();
        dfs(,);
        rep(i,,)
          rep(j,,n)
            bz[i][j]=bz[i-][bz[i-][j]];
        cin>>m;
        rep(i,,m)
        {
            int kk,x,y;
         cin>>kk>>x>>y;
          int k=lca(x,y);
          if (k!=x&&k!=y)
          {
              if (dfn1[x]>dfn1[y]) swap(x,y);
              a[i].a=dfn2[x],a[i].b=dfn1[y];
                a[i].c=k;
          } else
          {
              if (y==k) swap(x,y);
              a[i].a=dfn1[x],a[i].b=dfn1[y];
              a[i].c=;
          }
          a[i].d=i;
        }
        int n1=*n;
        block=sqrt(n1);
        num=(n1-)/block+;
        rep(i,,n1) pos[i]=(i-)/block+;
        sort(a+,a+m+,cmp);
        rep(i,,m)
        {
            if (a[i].a<=a[i-].a)
          rep(j,a[i].a,a[i-].a-) change(j,);
            if (a[i].b>=a[i-].b)
                rep(j,a[i-].b+,a[i].b) change(j,);
            if (a[i].a>a[i-].a)
                rep(j,a[i-].a,a[i].a-) change(j,-);
            if (a[i].b<a[i-].b)
              rep(j,a[i].b+,a[i-].b) change(j,-);
            if (a[i].c)
            {
                if (ans[c[a[i].c]]==) po[a[i].d]=ans2+;
                else po[a[i].d]=ans2;
            } else po[a[i].d]=ans2;
        }
        rep(i,,m) wer(po[i]),wer2();
    }
    fwrite(sr,,CC+,stdout);
    return ;
}