F：Three Kingdoms of Bourdelot

题目来源：
CSUOJ 2296: Three Kingdoms of Bourdelot
Codeforces Gym 101158 F. Three Kingdoms of Bourdelot

#include <iostream>
#include <iomanip>
#include <stdio.h>
#include <string.h>
#include <cmath>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <cctype>
#include <sstream>
#define LL long long
#define LD long double
#define ULL unsigned long long
#define UI unsigned int
#define _for(i,j,k) for(int i=j;i<=k;i++)
#define for_(i,j,k) for(int i=j;i>=k;i--)
#define lowbit(x) (x&-x)
#define ls(x) x<<1
#define rs(x) x<<1|1
//#pragma comment(linker, "/STACK:10240000000,10240000000")
using namespace std;
const int maxn = 1e3+5;
const int maxna = 3e3+5;
vector<pair<int,int> > doc[maxn];
vector<int> blong[maxna][maxna];
map<string,int> ntoid;
bool anc[maxna][maxna],vis[maxn];
int n,m,cnt;
string p,q;
bool dfs(int fa,int son);
bool setrel(int fa,int son){
    if(anc[son][fa]) return false;
    anc[fa][son]=1;
    _for(i,1,cnt){
        if(anc[i][fa]){
            if(anc[son][i]) return false;
            else{
                anc[i][son] = 1;
                if(!dfs(i,son)) return false;
            }
        }
        else if(anc[son][i]){
            if(anc[i][fa]) return false;
            else{
                anc[fa][i]=1;
                if(!dfs(fa,i)) return false;
            }
        }
    }
    return true;
}
bool dfs(int fa,int son){
    int ind,ma=blong[fa][son].size();
    for(int i=0;i<ma;i++){
        ind = blong[fa][son][i];
        if(vis[ind]) continue;
        vis[ind]=1;
        int sz = doc[ind].size();
        for(int j=0;j<sz;j++){
            if(!setrel(doc[ind][j].first,doc[ind][j].second)) return false;
            if(!dfs(doc[ind][j].first,doc[ind][j].second)) return false;
        }
    }
    return true;
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);cout.tie(0);
    cin>>p>>q;
    ntoid[p]=++cnt;
    ntoid[q]=++cnt;
    cin>>n;
    _for(i,1,n){
        cin>>m;
        _for(j,1,m){
            cin>>p>>q;
            if(!ntoid.count(p)) ntoid[p]=++cnt;
            if(!ntoid.count(q)) ntoid[q]=++cnt;
            blong[ntoid[p]][ntoid[q]].push_back(i);
            doc[i].push_back(make_pair(ntoid[p],ntoid[q]));
        }
    }
    anc[1][2]=1;
    if(dfs(1,2)) cout<<"Yes";
    else cout<<"No";
    return 0;
}