CF1037D Valid BFS?题解（双端队列）

CF1037D Valid BFS?

题面

题意

判断所给bfs序是否合法

思路

• bfs序和层序遍历有一定的相似之处，所以首先很容易能想到对深度进行判断，如果当前节点的深度比之前出现过的深度都小，那这个bfs序必是不合法的
• 但是深度判断不了子节点出现的先后顺序，所以考虑用deque存之前出现过的节点，每次从队尾插入新节点，并更新其父节点的度（用以判断其子节点是否全出现过），如果队首节点的子节点全都已经出现过，则从队首出队。如果出现非根节点的父节点不是队首节点，则说明子树顺序不合法。

代码

#include <bits/stdc++.h>
#define re read()
#define ll long long
#define pb(a) push_back(a)
#define mkp(a, b) make_pair(a, b)
#define mst(a, c) memset(a, c, sizeof(a))
#define rep(a, b, c) for(int a = b; a <= c; a++)
#define per(a, b, c) for(int a = b; a >= c; a--)
using namespace std;
int read()
{
	int num = 0; bool f = 0; char ch = getchar();
	while(ch < '0' || ch > '9') {f = (ch == '-'); ch = getchar();}
	while(ch >= '0' && ch <= '9') {num = (num << 1) + (num << 3) + ch - '0'; ch = getchar();}
	return f? -num : num;
}
int n, mx, cnt, flag;
const int MAXN = 2e5 + 11;
int fa[MAXN], hed[MAXN], dep[MAXN], deg[MAXN];
deque <int> dQ;
struct SF{int nxt, to;}edg[MAXN << 1];
void add_edge(int x, int y)
{
	edg[++cnt].to = y; edg[cnt].nxt = hed[x]; hed[x] = cnt;
	edg[++cnt].to = x; edg[cnt].nxt = hed[y]; hed[y] = cnt;
}
void dfs(int u)
{
	for(int i = hed[u]; i; i = edg[i].nxt)
	{
		int v = edg[i].to; if(dep[v]) continue;
		fa[v] = u; dep[v] = dep[u] + 1; dfs(v);
	}
}
int main()
{
//	clock_t TAT = clock();
//=====================================
	n = re; mx = flag = 1;
	rep(i, 1, n - 1) 
	{
		int x = re, y = re;
		add_edge(x, y);
		deg[x]++, deg[y]++;
	}
	fa[1] = 0; dep[1] = 1, deg[1]++; dfs(1); dQ.pb(1); 
	rep(i, 1, n) 
	{
		int x = re; dQ.pb(x); deg[fa[x]]--;
		if(mx > dep[x]) flag = 0; 
		if(fa[x] != dQ.front() && x != 1) flag = 0;
		mx = max(mx, dep[x]);
		while(!dQ.empty() && deg[dQ.front()] == 1) dQ.pop_front();
	} 
	puts(flag? "Yes" : "No");
//=====================================
//	cout<<"Time::"<<clock() - TAT<<"ms"<<'\n';
	return 0;
}