B. Interesting Vertices dfs序+线段树

B. Interesting Vertices
题解：暴力每个点的子树，在线段树中查是否合法。

#include<bits/stdc++.h>
#define m (l+r)/2
#define ls o*2
#define rs o*2+1
#define ll long long
using namespace std;
const int maxn = 2e5+10;
int f[maxn],d[maxn],r[maxn],id[maxn],cnt,a[maxn],vis[maxn],x[maxn];
vector<int>G[maxn];
int tr[maxn*4];
void up(int o,int l,int r,int k)
{
    if(l==r) {
      tr[o] += 1;
      return ;
    }
    if(k>m) up(rs,m+1,r,k);
    else up(ls,l,m,k);
    tr[o] = tr[ls] + tr[rs];
}
int qu(int o,int l,int r,int ql,int qr)
{
    if(ql<=l&&qr>=r) return tr[o];
    int ans = 0;
    if(ql<=m) ans += qu(ls,l,m,ql,qr);
    if(qr>m) ans += qu(rs,m+1,r,ql,qr);
    return ans ;
}
void dfs(int u,int fa,int dep)
{
    f[u] = fa;
    d[u] = dep;
    id[u] = ++cnt;
    for(auto v:G[u])
    if(v!=fa) dfs(v,u,dep+1);
    r[u] = cnt;
}
int main()
{
    int n,k;scanf("%d%d",&n,&k);
    int u,v;
    for(int i=1;i<=k;i++)scanf("%d",&a[i]),vis[a[i]]++;
    for(int i=1;i<n;i++){
      scanf("%d%d",&u,&v);
      G[u].push_back(v);
      G[v].push_back(u);
    }
    dfs(1,0,1);
    for(int i=1;i<=k;i++){
        up(1,1,n,id[a[i]]);
    }
    int ans = 0 ;
    int f ;
    for(int i=1;i<=n;i++)
    {
        f = 1;
        if(!vis[i]){
        for(auto v:G[i]){
       if(id[v]>id[i]) {
        if(!qu(1,1,n,id[v],r[v])){f = 0;}
       }else {
        if(!qu(1,1,n,1,id[i]-1)&&!qu(1,1,n,r[i]+1,n)) {f = 0;}
       }
      }
      if(f) {x[ans] = i ;ans ++;}
        }
    }
    printf("%d\n",ans);
    for(int i=0;i<ans;i++)
    printf("%d ",x[i]);
    puts("");
}