#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#define rt return
#define bk break
#define ct continue
#define sf scanf
#define pf printf
#define ms memset
#define si(n) sf("%d",&n)
#define pi(n) pf("%d",n)
#define REP0(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<=(n);i++)
#define REP(i,s,n) for(int i=s;i<=(n);i++)
#define db double
#define pb push_back
#define LL long long
#define INF 0x3fffffff
#define eps 1e-8
#define PI acos(-1)
#define maxn 110
using namespace std;
int n,m;
map <string,string> mapt;
string judge(string str1[],int cnt1,string str2[],int cnt2){
for(int i=0;i<cnt1;i++){
for(int j=0;j<cnt2;j++){
if(str1[i].compare(str2[j])==0){
rt str1[i];
}
}
}
}
int main(){
#ifdef ACBang
freopen("in.txt","r",stdin);
#endif
while(~sf("%d",&n)){
string s1,s2;
for(int i=0;i<n;i++){
cin>>s1;
cin>>s2;
mapt[s2]=s1;
}
sf("%d",&m);
for(int i=0;i<m;i++){
cin>>s1;
cin>>s2;
string str1[110],str2[110];
int cnt1=0,cnt2=0;
str1[cnt1++]=s1;
str2[cnt2++]=s2;
while(mapt.find(s1)!=mapt.end() ){
s1=mapt[s1];
str1[cnt1++]=s1;
}
while(mapt.find(s2)!=mapt.end() ){
s2=mapt[s2];
str2[cnt2++]=s2;
}
if(s1.compare(s2)==0){
string ans=judge(str1,cnt1,str2,cnt2);
cout<<ans<<endl;
}
else puts("-1");
}
}
rt 0;
}
第一次用map,写的很暴力;
题目意思:给你 父-子对,查询person1 person2是否有共同的祖先。有输出最近的一个,否则输出-1.
map的注意点,string