L2-030 冰岛人

所谓“五代以内无公共祖先”是指两人的公共祖先（如果存在的话）必须比任何一方的曾祖父辈分高。 这个条件卡 3 6 先找公共祖先 再判断是否大于双方的曾祖辈分

#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
struct Person{
	string xing,ming;
	int sx,f;
	vector<int> child;
}per[100005];
map<string,int> mp;
int vis[100005],flag;
int check(int x,int y){
	int i1=1,j1;
	for(int h=x;h!=-1;h=per[h].f,i1++){
		j1=1;
		for(int l=y;l!=-1;l=per[l].f,j1++){
			if(i1>=5&&j1>=5) break;
			if(h==l)
			 return 0;
		}
	}
	return 1;
}
int main(){
	int n,m,i,j,k;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		cin>>per[i].ming>>per[i].xing;
		mp[per[i].ming]=i;
	}
	for(i=0;i<n;i++){
		int len=per[i].xing.length();
		per[i].f=-1;
		if(per[i].xing[len-1]=='m')
		 per[i].sx=1;
		else if(per[i].xing[len-1]=='f')
		 per[i].sx=0;
		else if(per[i].xing.substr(len-4)=="sson"){
			per[i].sx=1;
			per[i].f=mp[per[i].xing.substr(0,len-4)];
		}
		else{
			per[i].sx=0;
			per[i].f=mp[per[i].xing.substr(0,len-7)];
		}
	}
	scanf("%d",&m);
	for(i=0;i<m;i++){
		Person s1,s2;
		cin>>s1.ming>>s1.xing>>s2.ming>>s2.xing;
		if(mp.count(s1.ming)==0||mp.count(s2.ming)==0)
		 {
		 	printf("NA\n");
		 	continue;
		 }
		int i1=mp[s1.ming],i2=mp[s2.ming];
		if(per[i1].sx==per[i2].sx)
		 printf("Whatever\n");
		else{
			flag=0;
			fill(vis,vis+n,0);
			vis[i1]=1;vis[i2]=1;
			if(check(i1,i2)==0) printf("No\n");
			else printf("Yes\n");
		}

	}
	return 0;
}