Path Intersection

http://codeforces.com/gym/102040 

思路：树链剖分区间修改，区间查询大于等于k值数量； 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=1e6+9;
const int maxm=4e5+9;
const int mod=1e9+7;


struct E
{
    int to,nex;
}edge[maxn*4];

struct node
{
    int Min,Max,lazy;
}tree[maxn<<2];

int n;
int head[maxn];
int tot;
int rk[maxn],fa[maxn],d[maxn],siz[maxn],son[maxn],top[maxn],id[maxn];
int cnt;

void addedge(int u,int v)
{
    edge[tot].to=v;
    edge[tot].nex=head[u];
    head[u]=tot++;
}
void dfs1(int u)
{
    //cout<<u<<endl;
    d[u]=d[fa[u]]+1;
    siz[u]=1;
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(v==fa[u]) continue;
        fa[v]=u;
        dfs1(v);
        siz[u]+=siz[v];
        if(siz[v]>siz[son[u]])
            son[u]=v;
    }
}
void dfs2(int u,int tp)
{
    top[u]=tp;
    id[u]=++cnt;
    rk[cnt]=u;
    if(!son[u]) return ;
    dfs2(son[u],tp);
    for(int i=head[u];i!=-1;i=edge[i].nex)
    {
        int v=edge[i].to;
        if(v!=son[u]&&v!=fa[u])
            dfs2(v,v);
    }
}


void pushup(int rt)
{
    tree[rt].Max=max(tree[rt<<1].Max,tree[rt<<1|1].Max);
    tree[rt].Min=min(tree[rt<<1].Min,tree[rt<<1|1].Min);
}
void pushdown(int rt,int l,int r)
{
    if(tree[rt].lazy&&l!=r)
    {
        tree[rt<<1].Max+=tree[rt].lazy;
        tree[rt<<1|1].Max+=tree[rt].lazy;

        tree[rt<<1].Min+=tree[rt].lazy;
        tree[rt<<1|1].Min+=tree[rt].lazy;

        tree[rt<<1].lazy+=tree[rt].lazy;
        tree[rt<<1|1].lazy+=tree[rt].lazy;

        tree[rt].lazy=0;
    }
}
void build(int rt,int l,int r)
{
    tree[rt].Max=0;
    tree[rt].Min=0;
    tree[rt].lazy=0;
    if(l==r)
    {
        return ;
    }
    int mid=(l+r)>>1;
    build(rt<<1,l,mid);
    build(rt<<1|1,mid+1,r);
    //pushup(rt);
}
void update(int rt,int l,int r,int ql,int qr,int val)
{
    if(ql<=l&&qr>=r)
    {
        tree[rt].lazy+=val;
        tree[rt].Max+=val;
        tree[rt].Min+=val;
        return ;
    }
    pushdown(rt,l,r);
    int mid=(l+r)>>1;
    if(ql<=mid) update(rt<<1,l,mid,ql,qr,val);
    if(qr>mid) update(rt<<1|1,mid+1,r,ql,qr,val);
    pushup(rt);
}
void update_line(int x,int y,int z)
{
    int tx=top[x];
    int ty=top[y];
    while(tx!=ty)
    {
        if(d[tx]>d[ty]) swap(x,y),swap(tx,ty);
        update(1,1,n,id[ty],id[y],z);
        y=fa[ty];
        ty=top[y];
    }
    if(d[x]>d[y]) swap(x,y);
    update(1,1,n,id[x],id[y],z);
}
ll query(int rt,int l,int r,int ql,int qr,int k)
{
    if(l==r)
    {
        if(tree[rt].Max>=k) return 1;
        return 0;
    }
    pushdown(rt,l,r);
    if(tree[rt].Max<k) return 0;
    if(tree[rt].Min==k) return min(r,qr)-max(l,ql)+1;
    ll ans=0;
    int mid=(l+r)>>1;
    if(ql<=mid) ans+=query(rt<<1,l,mid,ql,qr,k);
    if(qr>mid) ans+=query(rt<<1|1,mid+1,r,ql,qr,k);
    return ans;
}
ll query_line(int x,int y,int k)
{
    ll ans=0;
    int tx=top[x];
    int ty=top[y];
    while(tx!=ty)
    {
        if(d[tx]>d[ty])swap(x,y),swap(tx,ty);
        ans=ans+query(1,1,n,id[ty],id[y],k);
        y=fa[ty];
        ty=top[y];
    }
    if(d[x]>d[y])swap(x,y);
    ans+=query(1,1,n,id[x],id[y],k);
    return ans;
}

void init()
{
    tot=0;
    mem(head,-1);
    for(int i=0;i<=n;i++)
    {
        rk[i]=son[i]=d[i]=top[i]=fa[i]=siz[i]=id[i]=0;
    }
    cnt=0;
}

int a[maxn],b[maxn];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int T;
    //cin>>T;
    sfi(T);
    int cas=1;
    while(T--)
    {
        init();
        //cin>>n;
        sfi(n);
        for(int i=0;i<n-1;i++)
        {
            int u,v;
            //cin>>u>>v;
            sfi(u);
            sfi(v);
            addedge(u,v);
            addedge(v,u);
        }

        build(1,1,n);

        dfs1(1);

        dfs2(1,1);

        int q;
        //cin>>q;
        sfi(q);
        printf("Case %d:\n",cas++);
        while(q--)
        {
            int k;
            //cin>>k;
            sfi(k);
            for(int i=1;i<=k;i++)
            {
                //cin>>a[i]>>b[i];
                sfi(a[i]);
                sfi(b[i]);
                update_line(a[i],b[i],1);
            }
            //cout<<query_line(a[1],b[1],k)<<endl;
            pri(query_line(a[1],b[1],k));
            for(int i=1;i<=k;i++)
            {
                update_line(a[i],b[i],-1);
            }

        }
        //fl();
    }

    return 0;
}