LCA ---- E. Tree Queries[LCA或者dfs序的解法]

题目链接

---

题目大意：就是给你一颗树，然后$q$次询问每次询问会给出$k$个点，要求你判断一下这些点是否在存在一条从1到某个点u的链使得这k个点都在这条链上或者距离这条链距离为1的位置上

---

解法1：dfs序解法

---

解题思路：我们通过题意知道题目描述知道就是叫你判断一下这k个点自己或者自己的父亲节点在同一条链上.那么我们转化一下就是我们给你k个点判断一下这k个点的父亲是否在同一条链上

---

我们这里判断可以用$dfs序$的方式我们先将这k个点按照深度排序，深度大的一定在深度小的子树里面，那么我们可以用$dfs序$统计一下每个点第一次被范围的时间$dfn[i]$以及这个点的子树大小$Size[i]$

---

#include <iostream>
#include <cstdio>
#include <stack>
#include <sstream>
#include <vector>
#include <map>
#include <cstring>
#include <deque>
#include <cmath>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <set>
#define mid ((l + r) >> 1) 
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define _for(i,a,b) for( int i = (a); i < (b); ++i)
#define _rep(i,a,b) for( int i = (a); i <= (b); ++i)
#define for_(i,a,b) for( int i = (a); i >= (b); -- i)
#define rep_(i,a,b) for( int i = (a); i > (b); -- i)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define hash Hash
#define next Next
#define count Count
#define pb push_back
#define f first
#define s second
using namespace std;
const int N = 2e5+10, mod = 1e9 + 7;
const double eps = 1e-10;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) 
{
    read(first);
    read(args...);
}

int n, m;
vector<int> G[N];
int dfn[N], deep[N], fa[N], Size[N], cnt;
inline void add(int from, int to)
{
    G[from].pb(to);
    return;
}
int tmp[N];
inline void dfs(int u, int f, int dep)
{
     dfn[u] = ++ cnt, fa[u] = f, Size[u] = 1, deep[u] = dep;
     for(auto it : G[u])
         if(!dfn[it])
          dfs(it,u,dep+1), Size[u] += Size[it];
     return;
}

inline bool cmp(int x, int y){return deep[x] < deep[y];}

inline bool check(int x, int y)//判断x是否在y子树中
{
    if(dfn[x] < dfn[y]) return 0;
    if(dfn[x] >= dfn[y] + Size[y]) return 0;
    return 1;
}

int main()
{
    read(n,m);
    n -= 1;
    while(n--)
    {
        int l, r;
        read(l,r);
        add(l,r), add(r,l);
    }
    dfs(1,0,0);
    while(m --)
    {
        int num;
        read(num);
        _for(i,0,num) 
        {
            int son;
            read(son);
            if(son != 1)
            tmp[i] = fa[son];
            else tmp[i] = son;
        }
        sort(tmp,tmp+num,cmp);
        bool flag = 0;
        _for(i,1,num)
          if(!check(tmp[i],tmp[i-1]))
          {
              flag = true;
              break;
          }
        if(flag) puts("NO");
        else puts("YES");
    }
    return 0;
}
 

---

解法2：LCA

---

解题思路：我们可以先将点按照深度排序，然后用深度大的点和每一个点分别求LCA,如果在同一条链上LCA的结果一定是深度比较浅的点，如果是距离为1那么LCA的结果就是深度浅的点的父亲节点

---

#include <iostream>
#include <cstdio>
#include <stack>
#include <sstream>
#include <vector>
#include <map>
#include <cstring>
#include <deque>
#include <cmath>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <set>
#define mid ((l + r) >> 1) 
#define Lson rt << 1, l , mid
#define Rson rt << 1|1, mid + 1, r
#define ms(a,al) memset(a,al,sizeof(a))
#define log2(a) log(a)/log(2)
#define _for(i,a,b) for( int i = (a); i < (b); ++i)
#define _rep(i,a,b) for( int i = (a); i <= (b); ++i)
#define for_(i,a,b) for( int i = (a); i >= (b); -- i)
#define rep_(i,a,b) for( int i = (a); i > (b); -- i)
#define lowbit(x) ((-x) & x)
#define IOS std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define INF 0x3f3f3f3f
#define hash Hash
#define next Next
#define count Count
#define pb push_back
#define f first
#define s second
using namespace std;
const int N = 2e5+10, mod = 1e9 + 7;
const double eps = 1e-10;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
template<typename T> void read(T &x)
{
    x = 0;char ch = getchar();ll f = 1;
    while(!isdigit(ch)){if(ch == '-')f*=-1;ch=getchar();}
    while(isdigit(ch)){x = x*10+ch-48;ch=getchar();}x*=f;
}
template<typename T, typename... Args> void read(T &first, Args& ... args) 
{
    read(first);
    read(args...);
}

int n, m;
vector<int> G[N];
int dp[N][30];
int d[N];

inline void add(int from, int to)
{
    G[from].pb(to);
    return;
}
int tmp[N];

inline void dfs(int fa, int rt, int deep)
{
    dp[rt][0] = fa, d[rt] = deep;
    for(auto it : G[rt])
       if(it != fa)
         dfs(rt,it,deep+1);
}

void init()
{
    dfs(-1,1,0);
   
    for(int j = 0;(1 << (j+1) < n); ++ j)
    {
        for(int i = 1; i <= n; ++ i)
          if(dp[i][j] < 0) dp[i][j+1] = -1;
          else dp[i][j + 1] = dp[dp[i][j]][j];
    }
}

inline bool cmp(int x, int y) 
{
    return d[x] < d[y];
}

inline bool LCA(int u, int v)
{
    int pos = u;
    int temp = d[v] - d[u];
    for(int i = 0; (1 << i) <= temp; ++ i)
    {
        if((1 << i) & temp) v = dp[v][i];
    }
    if(v == u) return true;
    for(int i = log2(n); i >= 0; -- i)
       if(dp[u][i] != dp[v][i])
       {
           u = dp[u][i], v = dp[v][i];
       }
      if(u == pos) return true;
      else return false;
}

int main()
{
    read(n,m);
    
    _for(i,0,n-1)
    {
        int l, r;
        read(l,r);
        add(l,r), add(r,l);
    }
    init();
    while(m --)
    {
        int num;
        read(num);
        _for(i,0,num)
          read(tmp[i]);
         sort(tmp,tmp+num,cmp);
         bool flag = false;
        _for(i,0,num-1)
           if(!LCA(tmp[i],tmp[num-1]))
           {
               flag = true;
               break;
           }
         if(flag) puts("NO");
         else puts("YES");
    }
    return 0;
}