参考博客
这个题主要是vector数组+dfs
#include <bits/stdc++.h>
using namespace std;
int n;
vector<int> vec[100010];
char s[100010];
int vis[100010];
int flag;
void dfs(int sou,int deep){
if(deep>=5)
return;
for(int i=0;i<vec[sou].size();++i){
if(!vis[vec[sou][i]]){
vis[vec[sou][i]]=1;
dfs(vec[sou][i],deep+1);
}
else
flag=1;
}
}
int main()
{
cin>>n;
int self,fa,ma;
char sex;
for(int i=0;i<n;++i){
cin>>self>>sex>>fa>>ma;
s[self]=sex;
if(fa!=-1){
vec[self].push_back(fa);
s[fa]='M';
}
if(ma!=-1){
vec[self].push_back(ma);
s[ma]='F';
}
}
int k;
cin>>k;
int a,b;
for(int i=0;i<k;++i){
cin>>a>>b;
if(s[a]==s[b]){
cout<<"Never Mind";
if(i<k-1)
cout<<endl;
continue;
}
flag=0;
memset(vis,0,sizeof(vis));
vis[a]=1;
vis[b]=1;
dfs(a,1);
dfs(b,1);
if(flag==1){
cout<<"No";
}else{
cout<<"Yes";
}
if(i<k-1)
cout<<endl;
}
return 0;
}