#include<bits/stdc++.h>
#include<vector>
#include<iostream>
using namespace std;
#include<queue>
int n;
typedef struct Point
{
int num;
int father;
vector<int>son;
};
Point point[200005];
int order[200005];
vector<int>vec[200005];
void dfs(int u,int fa)
{
for(int i=0;i<vec[u].size();i++)
{
int v=vec[u][i];
if(v==fa)
continue;
point[u].son.push_back(v);
dfs(v,u);
}
}
bool bfs()
{
queue<Point>q;
q.push(point[1]);
int pos=2;
while(!q.empty())
{
//if(pos>n)
// return false;
Point temp;
temp=q.front();
//cout<<temp.num<<"sdw"<<endl;
q.pop();
int i;
bool flag=0;
while(point[temp.num].son.size()!=0)
{
for(i=0;i<point[temp.num].son.size();i++)
{
//cout<<point[temp.num].son[i]<<" "<<order[pos]<<endl;
if(point[temp.num].son[i]==order[pos])
{
flag=1;
pos++;
q.push(point[point[temp.num].son[i]]);
point[temp.num].son.erase(point[temp.num].son.begin()+i);
//cout<<point[temp.num].son[i]<<" "<<point[point[temp.num].son[i]].num<<"hdiwer\n";
break;
}
}
if(flag==0)
return false;
flag=0;
}
}
return true;
}
int main()
{
scanf("%d",&n);
int i;
for(i=1;i<=n;i++)
point[i].num=i;
for(i=0;i<n-1;i++)
{
int a,b;
scanf("%d%d",&a,&b);
//point[b].father=a;
//point[a].son.push_back(b);
vec[a].push_back(b);
vec[b].push_back(a);
}
for(i=1;i<=n;i++)
scanf("%d",&order[i]);
if(order[1]!=1)
{
printf("No\n");
return 0;
}
dfs(1,-1);
//for(i=1;i<=n;i++)
// cout<<point[i].num<<" "<<point[i].son.size()<<endl;
if(bfs())
printf("Yes\n");
else
printf("No\n");
return 0;
}
这是一份超时的代码