L2-016 愿天下有情人都是失散多年的兄妹

#include <bits/stdc++.h>
#define int long long
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
using namespace std;
const int N = 1e5 + 10, M = N * 2;
const int INF = 0x3f3f3f3f3f3f3f3f;
int dad[N], mom[N];
map<int, char> mp;
void up(int u, int d, map<int, int>& st)
{
    if(d == 6 || u == -1) return;
    st[u] = 1;
    d += 1;
    up(dad[u], d, st);
    up(mom[u], d, st);
}
signed main()
{
    memset(dad, -1, sizeof dad);
    memset(mom, -1, sizeof mom);
    int n;
    cin >> n;
    for(int i = 0; i < n; i ++)
    {
        int id, fa , ma;
        char sex;
        cin >> id >> sex >> fa >> ma;
        mp[id] = sex;
        mp[fa]  = 'M';
        mp[ma] = 'F';
        dad[id] = fa;
        mom[id] = ma;
    }
    int t;
    cin >> t;
    while(t --)
    {
        int a , b;
        cin >> a >> b;
        if(mp[a] == mp[b])
        {
            cout << "Never Mind" << endl;
            continue;
        }
        // 分别按照父辈和母辈寻找
        map<int, int> mpa, mpb;
        up(a, 1, mpa);
        up(b, 1, mpb);
        
        int ff = 0;
        for(auto it : mpa)
        {
            int x = it.first;
            if(mpb[x] == 1)
            {
                ff = 1;
            }
        }
        if(ff) cout << "No" << endl;
        else cout << "Yes" << endl;
    }
    return 0;
}