【CodeForces】CF1037D Valid BFS?

题目地址：

https://www.luogu.com.cn/problem/CF1037D

题面翻译：
给定一个$n(1\le n\le 2\cdot 10^5)$个节点的树的$n-1$条边和这棵树的一个$BFS$序$a_1,a_2,\dots ,a_n$,判断这个$BFS$序是否是一个从节点$1$开始的合法$BFS$序,若合法则输出$Yes$,否则输出$No$。

题目描述：
The BFS algorithm is defined as follows.

1. Consider an undirected graph with vertices numbered from $1$ to $n$ . Initialize $q$ as a new queue containing only vertex $1$ , mark the vertex $1$ as used.
2. Extract a vertex $v$ from the head of the queue $q$ .
3. Print the index of vertex $v$ .
4. Iterate in arbitrary order through all such vertices $u$ that $u$ is a neighbor of $v$ and is not marked yet as used. Mark the vertex $ u $ as used and insert it into the tail of the queue $q$ .
5. If the queue is not empty, continue from step 2.
6. Otherwise finish.
   Since the order of choosing neighbors of each vertex can vary, it turns out that there may be multiple sequences which BFS can print.

In this problem you need to check whether a given sequence corresponds to some valid BFS traversal of the given tree starting from vertex $1$ . The tree is an undirected graph, such that there is exactly one simple path between any two vertices.

输入格式：
The first line contains a single integer $n$ ( $1\le n\le 2\cdot 10^5$ ) which denotes the number of nodes in the tree.

The following $n-1$ lines describe the edges of the tree. Each of them contains two integers $x$ and $y$ ( $1\le x,y\le n$ ) — the endpoints of the corresponding edge of the tree. It is guaranteed that the given graph is a tree.

The last line contains $n$ distinct integers $a_1,a_2,\dots ,a_n$ ( $1\le a_i\le n$ ) — the sequence to check.

输出格式：
Print “Yes” (quotes for clarity) if the sequence corresponds to some valid BFS traversal of the given tree and “No” (quotes for clarity) otherwise.

You can print each letter in any case (upper or lower).

可以直接BFS模拟。首先$1$一定是一开始就会遍历到的点，接下来从$1$开始BFS，首先将出队的点的所有未遍历过的点都放入一个哈希表，然后看一下序列，按序列里的次序遍历哈希表里的点（如果某个点不在哈希表里，则序列不成立），依次再加入队列以便下一轮BFS。这样直到所有点都遍历完成，如果一直没有问题，则说明序列成立。代码如下：

#include <iostream>
#include <cstring>
#include <queue>
#include <unordered_set>
using namespace std;

const int N = 2e5 + 10, M = 2 * N;
int n;
int h[N], e[M], ne[M], idx;
bool vis[N];
queue<int> q, o;

#define add(a, b) e[idx] = b, ne[idx] = h[a], h[a] = idx++

bool bfs() {
  vis[1] = true;
  q.push(1);
  if (o.front() != 1) return false;
  o.pop();
  while (q.size()) {
    unordered_set<int> st;
    int t = q.front(); q.pop();
    for (int i = h[t]; ~i; i = ne[i]) {
      int v = e[i];
      if (vis[v]) continue;
      vis[t] = true;
      st.insert(v);
    }

    while (st.size()) {
      int t = o.front();
      if (!st.count(t)) return false;
      st.erase(t);
      q.push(t);
      o.pop();
    }
  }
  return true;
}

int main() {
  memset(h, -1, sizeof h);
  scanf("%d", &n);
  for (int i = 0; i < n - 1; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    add(a, b), add(b, a);
  }

  for (int i = 1; i <= n; i++) {
    int x;
    scanf("%d", &x);
    o.push(x);
  }

  puts(bfs() ? "Yes" : "No");
}

时空复杂度$O(n)$。