[国家集训队]稳定婚姻 - 洛谷https://www.luogu.com.cn/problem/P1407典型的二分图匹配问题,但这道题要先把正式夫妻先配对起来,先女后男,所以把男的都匹配上他们的老婆,然后再在有暧昧关系的两者之间建边,每次用匈牙利匹配的时候我们就可以把正房拆开,让他老婆去找有没有小三能跟她,如果有一个女的能找到被她抛弃的老公说明就可以起到连锁反应让他们都偷上情,当然匹配完后要把那一对夫妻重新绑定起来。
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <bitset>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1e6 + 10;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))
map<string, int> mp;
int head[MAXN];
int nxt[MAXN];
int ver[MAXN];
int match[MAXN];
int vis[MAXN];
int cnt;
void add(int x, int y) {
ver[++cnt] = y;
nxt[cnt] = head[x];
head[x] = cnt;
}
int id;
bool dfs(int p) {
for (int i = head[p]; i; i = nxt[i]) {
int v = ver[i];
if (vis[v] - id) {
vis[v] = id;
if (!match[v] || dfs(match[v])) {
return 1;
}
}
}
return 0;
}
int main() {
IOS;
cin.tie(0);
int n;
cin >> n;
// scanf("%d",&n);
// int rec=0;
for (int i = 1; i <= n; i++) {
string s1, s2;
cin >> s1 >> s2;
mp[s1] = i;
mp[s2] = n + i;
match[mp[s2]] = mp[s1];
}
int m;
cin >> m;
for (int i = 1; i <= m; i++) {
string s1, s2;
cin >> s1 >> s2;
add(mp[s1], mp[s2]);
}
for (int i = id = 1; i <= n; i++, id++) {
match[n + i] = 0;
if (dfs(i))
printf("Unsafe\n");
else
printf("Safe\n");
match[n + i] = i;
}
return 0;
}