7-42 愿天下有情人都是失散多年的兄妹 （25 分)

呵呵，这道破题，坑点在父母也算。。。性别也要比较

#include<bits/stdc++.h>
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define ll long long
#define ld long double
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define lcm(a,b) ((a)*(b)/(__gcd((a),(b))))
#define mod 1000000007
#define MP make_pair
#define PI pair<int,int>
using namespace std;
const int N = 1e6 + 100;
int n, ff;
char s;
struct node {
    char s;
    int f, m;
    node(): f(-1), m(-1), s('M') {}
} no[N];
void dfs(int a, int b, int a1) {
    if(a == -1 || b == -1)
        return;
    if(a1 >= 5)
        return;
    if(a == b) {
        ff = 1;
    }
    dfs(no[a].f, no[b].f, a1 + 1);
    dfs(no[a].m, no[b].m, a1 + 1);
    dfs(no[a].m, no[b].f, a1 + 1);
    dfs(no[a].f, no[b].m, a1 + 1);
}
int main() {
    scanf("%d", &n);
    for(int id, i = 0; i < n; i++) {
        scanf("%d", &id);
        getchar();
        scanf("%c%d%d", &no[id].s, &no[id].f, &no[id].m);
        if(no[id].f != -1)
            no[no[id].f].s = 'M';
        if(no[id].m != -1)
            no[no[id].m].s = 'F';
    }
    cin >> n;
    for(int a, b, i = 0; i < n; i++) {
        ff = 0;
        cin >> a >> b;
        if(no[a].s == no[b].s) {
            cout << "Never Mind" << endl;
            continue;
        }
        dfs(a, b, 0);
        if(!ff)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
    return 0;
}