HDU 5614 Baby Ming and Matrix tree （树链剖分+线段树区间修改）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=2e4+10;
const int maxm=5e5+10;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int n,m;
vector<int> g[maxn];
int ID(int x1,int y1,int x2,int y2){
    if((x1^x2)&&(x1^y1)){
        return x1;
    }else{
        if(!y2) return 2+(x2^1);
        else return 4+(y1^1);
    }
}
struct segtree{
    int tree[maxn<<2],lazy[maxn<<2];
    void init(){
        mst(tree,0),mst(lazy,-1);
    }
    void pushdown(int x,int l,int r){
        if(lazy[x]!=-1){
            int mid=l+r>>1;
            tree[x<<1]=(mid-l+1)*lazy[x];
            tree[x<<1|1]=(r-mid)*lazy[x];
            lazy[x<<1]=lazy[x<<1|1]=lazy[x];
            lazy[x]=-1;
        }
    }
    void update(lrt,int pos){
        if(l==r){
            tree[rt]++;
            return ;
        }
        int mid=l+r>>1;
        if(pos<=mid) update(lson,pos);
        else update(rson,pos);
        tree[rt]=tree[rt<<1]+tree[rt<<1|1];
    }
    void update(lrt,int L,int R,int v){
        if(L<=l&&r<=R){
            lazy[rt]=v,tree[rt]=(r-l+1)*v;
            return ;
        }
        pushdown(rt,l,r);
        int mid=l+r>>1;
        if(L<=mid) update(lson,L,R,v);
        if(mid<R) update(rson,L,R,v);
        tree[rt]=tree[rt<<1]+tree[rt<<1|1];
    }
    int query(lrt,int L,int R){
        if(L<=l&&r<=R) return tree[rt];
        int mid=l+r>>1,ret=0;
        pushdown(rt,l,r);
        if(L<=mid) ret+=query(lson,L,R);
        if(mid<R) ret+=query(rson,L,R);
        return ret;
    }
}seg[6];
int dep[maxn],fa[maxn],sz[maxn],son[maxn];
void dfs1(int u,int f){
    dep[u]=dep[f]+1,sz[u]=1,son[u]=0,fa[u]=f;
    for(auto v:g[u]) if(v^f){
        dfs1(v,u);
        sz[u]+=sz[v];
        if(sz[v]>sz[son[u]]) son[u]=v;
    }
}
int tot=0,dfn[maxn],top[maxn];
void dfs2(int u,int f){
    dfn[u]=++tot,top[u]=f;
    if(son[u]) dfs2(son[u],f);
    for(auto v:g[u]) if(v!=fa[u]&&v!=son[u])
        dfs2(v,v);
}
int Q(int x,int y,int id){
    int ret=0;
    while(top[x]^top[y]){
        if(dep[top[x]]<dep[top[y]]) swap(x,y);
        ret+=seg[id].query(1,n,1,dfn[top[x]],dfn[x]);
        x=fa[top[x]];
    }
    if(dep[x]>dep[y]) swap(x,y);
    ret+=seg[id].query(1,n,1,dfn[x],dfn[y]);
    return ret;
}
void change(int x,int y,int id,int v){
    while(top[x]^top[y]){
        if(dep[top[x]]<dep[top[y]]) swap(x,y);
        seg[id].update(1,n,1,dfn[top[x]],dfn[x],v);
        x=fa[top[x]];
    }
    if(dep[x]>dep[y]) swap(x,y);
    seg[id].update(1,n,1,dfn[x],dfn[y],v);
}
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    int t;cin>>t;
    while(t--){
        cin>>n;
        tot=0;
        rep(i,1,n+1) g[i].clear();
        rep(i,0,6) seg[i].init();
        rep(i,1,n){
            int x,y;
            cin>>x>>y;
            g[x].push_back(y);
            g[y].push_back(x);
        }
        dfs1(1,0),dfs2(1,1);
        rep(i,1,n+1){
            int x1,y1,x2,y2,id;
            cin>>x1>>y1>>x2>>y2;
            id=ID(x1,y1,x2,y2);
            seg[id].update(1,n,1,dfn[i]);
        }
        cin>>m;
        rep(i,0,m){
            int x,y,x1,y1,x2,y2;
            cin>>x>>y>>x1>>y1>>x2>>y2;
            int id=ID(x1,y1,x2,y2),ans=0;
            if(id<=1){
                for(int j=2;j<=5;j++) ans+=10*Q(x,y,j);
                ans+=2*Q(x,y,id^1);
            }else{
                for(int j=0;j<=1;j++) ans+=10*Q(x,y,j);
                for(int j=2;j<=5;j++) ans+=2*Q(x,y,j)*((id-j+4)%4);
            }
            cout<<ans<<"\n";
            for(int j=0;j<=5;j++){
                if(j^id) change(x,y,j,0);
                else change(x,y,j,1);
            }
        }
    }
    return 0;
}