题目传送门
题意:给一颗树,给一个序列,问你这个序列是不是这棵树的合法bfs序列。
思路1:每次拿一个点,把它的儿子放到一个数组中,再想序列中接着拿与他儿子相同数目的点,看排序后是否一样,是则继续向后判断,否则不合法。
思路2:先dfs 一遍,记录每个点的父节点,并且记录一个节点有没有子节点。根据bfs的规律,一个先出现的节点,他的子节点也必然先出现,但是如果对于一个没有子节点的点,我们应该跳过。
代码1
//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
#define endl '\n'
#define null NULL
#define ls p<<1
#define rs p<<1|1
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ll long long
#define int long long
#define vi vector<int>
#define mii map<int,int>
#define pii pair<int,int>
#define ull unsigned long long
#define pqi priority_queue<int>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
char *fs,*ft,buf[1<<20];
#define gc() (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<20,stdin),fs==ft))?0:*fs++;
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=gc();}
return x*f;}
using namespace std;
const int N=4e5+5;
const int inf=0x7fffffff;
const int mod=1e9+7;
const double eps=1e-6;
int head[N],nxt[N],to[N],tot=0;
void add(int u,int v)
{
nxt[++tot]=head[u];to[tot]=v;head[u]=tot;
}
int a[N],vis[N];
signed main()
{
int n;
cin>>n;
for(int i=1;i<=n-1;i++)
{
int u,v;
cin>>u>>v;
add(u,v);add(v,u);
}
for(int i=1;i<=n;i++)
cin>>a[i];
if(a[1]!=1)
{
cout<<"No"<<endl;
return 0;
}
queue<int>q;
bool ok=1;
q.push(1);
vis[1]=1;
int j=2;
while(!q.empty())
{
vector<int> tmp,buf;
int u=q.front();q.pop();
for(int i=head[u];i;i=nxt[i])
{
int v=to[i];
if(vis[v]) continue;
tmp.push_back(v);
vis[v]=true;
}
int m=tmp.size();
while(m--)
{
buf.push_back(a[j]);
q.push(a[j]);
j++;
}
if(tmp.size()!=buf.size())
ok=0;
else
{
sort(tmp.begin(),tmp.end());
sort(buf.begin(),buf.end());
for(int i=0;i<tmp.size();i++)
{
if(tmp[i]!=buf[i])
{
ok=0;
break;
}
}
}
if(!ok) break;
}
if(ok)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
代码2
//#include<bits/stdc++.h>
#include<iostream>
#include<cstring>
#include<queue>
#include<algorithm>
#define endl '\n'
#define null NULL
#define ls p<<1
#define rs p<<1|1
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ll long long
#define int long long
#define vi vector<int>
#define mii map<int,int>
#define pii pair<int,int>
#define ull unsigned long long
#define pqi priority_queue<int>
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
char *fs,*ft,buf[1<<20];
#define gc() (fs==ft&&(ft=(fs=buf)+fread(buf,1,1<<20,stdin),fs==ft))?0:*fs++;
inline int read(){
int x=0,f=1;char ch=gc();
while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=gc();}
return x*f;}
using namespace std;
const int N=4e5+5;
const int inf=0x7fffffff;
const int mod=1e9+7;
const double eps=1e-6;
int head[N],nxt[N],to[N],tot=0;
void add(int u,int v)
{
nxt[++tot]=head[u];to[tot]=v;head[u]=tot;
}
int a[N],fa[N],son[N],vis[N];
void dfs(int x,int y)
{
fa[x]=y;son[y]=1;
for(int i=head[x];i;i=nxt[i])
{
if(to[i]!=y)
dfs(to[i],x);
}
}
signed main()
{
int n;
cin>>n;
for(int i=1;i<=n-1;i++)
{
int u,v;
cin>>u>>v;
add(u,v);add(v,u);
}
for(int i=1;i<=n;i++)
cin>>a[i];
dfs(1,0);
int now=1;
if(a[1]!=1)
{cout<<"No"<<endl;return 0;}
for(int i=2;i<=n;i++)
{
if(vis[a[i]])
{
cout<<"No"<<endl;return 0;
}
vis[a[i]]=1;
if(fa[a[i]]==a[now])
continue;
if(fa[a[i]]!=a[now])
{
now++;
while(son[a[now]]==0&&now<i)
now++;
if(fa[a[i]]!=a[now])
{
cout<<"No"<<endl;return 0;
}
}
}
cout<<"Yes"<<endl;
}