9-7测试总结

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<vector>
#define N 300040
using namespace std;
int n,m,dfn[N],In[N],cnt,ans[N],num,Out[N],Time;
int rep[N],head[N],next[N<<1],to[N<<1],watch[N],deep[N],root[N*3],Fa[N];
struct note{
    int s,t,lca;
}runner[N];
struct que{
    int id,v;
};
struct tree{
    int l,r,sum;
}T[N*75];
vector<que> ques[N];
int getrep(int u)
{
    if(u==rep[u]) return u;
    return rep[u]=getrep(rep[u]);
}
void change(int &now,int l,int r,int pos,int w)
{
    if(!pos) return;
    if(!now) now=++cnt;
    T[now].sum+=w;
    if(l==r) return;
    int mid=(l+r)>>1;
    if(pos<=mid) change(T[now].l,l,mid,pos,w);else
    change(T[now].r,mid+1,r,pos,w);
}
int query(int now,int l,int r,int x,int y)
{
    if(!now) return 0;
    if(l==x&&r==y) return T[now].sum;
    int mid=(l+r)>>1;
    if(x>mid) return query(T[now].r,mid+1,r,x,y);else
    if(y<=mid) return query(T[now].l,l,mid,x,y);else
    return query(T[now].l,l,mid,x,mid)+query(T[now].r,mid+1,r,mid+1,y);
}
void clear_rep()
{
    for(int i=1;i<=n;i++)
    rep[i]=i;
}
void make_way(int u,int v)
{
    to[++num]=v;
    next[num]=head[u];
    head[u]=num;
}
void tarjan(int u,int fa)
{
    dfn[u]=In[u]=++Time;
    for(int edge=head[u];edge;edge=next[edge])
    if(!In[to[edge]])
    {
        deep[to[edge]]=deep[u]+1;
        tarjan(to[edge],u);
        int v=to[edge];
        Fa[v]=u;
        rep[getrep(to[edge])]=u;
    }
    for(int i=0;i<ques[u].size();i++)
    if(In[ques[u][i].v]) runner[ques[u][i].id].lca=getrep(ques[u][i].v);
    Out[u]=Time;
}
void clear()
{
    memset(root,0,sizeof(root));
    for(int i=1;i<=cnt;i++) T[i].l=T[i].r=T[i].sum=0;
    cnt=0;
}
int main()
{
    scanf("%d %d",&n,&m);
    int u,v;
    for(int i=1;i<n;i++)
    {
        scanf("%d %d",&u,&v);
        make_way(u,v);make_way(v,u);
    }
    for(int i=1;i<=n;i++)scanf("%d",&watch[i]);
    clear_rep();
    for(int i=1;i<=m;i++){
        scanf("%d %d",&u,&v);
        runner[i].s=u,runner[i].t=v;
        ques[u].push_back((que){i,v});
        ques[v].push_back((que){i,u});
    }
    tarjan(1,0);
    int now;
    for(int i=1;i<=m;i++)
    {
        now=deep[runner[i].s];
        change(root[now],1,n,dfn[runner[i].s],1);
        change(root[now],1,n,dfn[Fa[runner[i].lca]],-1);
    }
    for(int i=1;i<=n;i++) ans[i]+=query(root[deep[i]+watch[i]],1,n,In[i],Out[i]);
    clear();
    for(int i=1;i<=m;i++)
    {
        now=deep[runner[i].s]-deep[runner[i].lca]*2+n*2;
        change(root[now],1,n,dfn[runner[i].t],1); 
        change(root[now],1,n,dfn[runner[i].lca],-1); 
    }
    for(int i=1;i<=n;i++) ans[i]+=query(root[watch[i]-deep[i]+n*2],1,n,In[i],Out[i]); 
    for(int i=1;i<n;i++) printf("%d ",ans[i]); 
    printf("%d\n",ans[n]); 
 }