L2-030 冰岛人 (25 分)

原题链接

#include <bits/stdc++.h>
using namespace std;
bool judge(vector<int> &F, int s1, int s2)
{
    int n = F.size();
    vector<int> count(n, 0);
    vector<int> dist1(n, 0);
    vector<int> dist2(n, 0);
    int t ;
    count[s1]++;
    count[s2]++;
    while(F[s1] != -1)
    {
        t = F[s1];
        count[t]++;
        dist1[t] = dist1[s1] + 1;
        if(t == s2)			//直系祖宗...太乱了，直接false，不加这个，会有两个点过不去
          return false;
        s1 = t;
    }
    while(F[s2] != -1)
    {
        t = F[s2];
        count[t]++;
        dist2[t] = dist2[s2] + 1;
        if(count[t] > 1)
        {
            if(dist2[t]>=4 && dist1[t] >= 4)
                return true;
            else
                return false;
        }
        s2 = t;
    }
    return true;
}
int main()
{
    int n;
    cin >> n;
    string f1, f2;
    vector<bool> sex(n);
    vector<vector<string> > record(n);
    map<string, int> M;			//给每个人编号
    vector<int> F(n, -1);		//父节点编号
    int cnt = 0;
    for(int i=0;i<n;i++)		//编号
    {
        cin >> f1 >> f2;
        M.insert(make_pair(f1, cnt));
        int l = f2.size();
        if(f2[l-1] == 'm' || f2[l-1] == 'n')
            sex[cnt] = 1;       //男
        else
            sex[cnt] = 0;
        cnt++;
        record[i].push_back(f1);
        record[i].push_back(f2);
    }
    string par;
    for(int i=0;i<n;i++)		//找父节点
    {
        f1 = record[i][0];
        f2 = record[i][1];
        int len = f2.size();
        if(f2[len-1] != 'r' && f2[len-1] != 'n')	//老祖宗
            continue;
        if(sex[M[f1]] == true)
            par = f2.substr(0, len-4);
        else
            par = f2.substr(0, len-7);
        F[M[f1]] = M[par];
    }
    int m;
    cin >> m;
    string t1,t2;
    for(int i=0;i<m;i++)
    {
        cin >> f1 >> f2 >> t1 >> t2;
        if(M.find(f1) == M.end() || M.find(t1) == M.end() )
        {
            cout << "NA" << endl;
            continue;
        }
        if(sex[M[f1]] == sex[M[t1]])
        {
            cout << "Whatever" << endl;
            continue;
        }
        if(judge(F, M[f1], M[t1]))
        {
            cout << "Yes" << endl;
        }
        else
            cout << "No" << endl;
    }
    return 0;
}