题意:有n对夫妻,参加一个派对,其中夫妻2人只能有1人参加,有m个人存在矛盾(非夫妻),存在矛盾的人不能同时参加派对,求出是否能有n个人来参加派对
思路:存在矛盾时,其中一人只能与另一人的夫妻同时参加,故两人分别与另一人的夫妻连边,用tarjan求强连通分量,判断夫妻是否在同一个连通分量中,若是则不存在n个人参加派对
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<vector>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn = 1e5+10;
const int inf = 0x3f3f3f3f;
int n, m, dfn[maxn], low[maxn], vis[maxn], u[maxn], cnt, cnt2;
vector<int> g[maxn];
stack<int> s;
void tarjan(int x)
{
dfn[x] = low[x] = ++cnt;
s.push(x);
vis[x] = 1;
for (int i = 0; i < g[x].size(); i++) {
int v = g[x][i];
if (!dfn[v]) {
tarjan(v);
low[x] = min(low[x], low[v]);
} else if (vis[v])
low[x] = min(low[x], dfn[v]);
}
if (low[x] == dfn[x]) {
cnt2++;
while (1) {
int y = s.top(); s.pop();
vis[y] = 0;
u[y] = cnt2;
if (y == x)
break;
}
}
}
int main()
{
while (~scanf("%d", &n)) {
scanf("%d", &m);
cnt = 0, cnt2 = 0;
memset(dfn, 0, sizeof(dfn));
memset(vis, 0, sizeof(vis));
memset(u, 0, sizeof(u));
for (int i = 0; i < 2*(n+1); i++) {
g[i].clear();
}
int u1, u2, c1, c2;
for (int i = 0; i < m; i++) {
scanf("%d%d%d%d", &u1, &u2, &c1, &c2);
u1 = u1*2+c1;
u2 = u2*2+c2;
g[u1].push_back(u2^1);
g[u2].push_back(u1^1);
}
for (int i = 0; i < 2*n; i++)
if (!dfn[i])
tarjan(i);
int flag = 0;
for (int i = 0; i < n; i++)
if (u[2*i] == u[2*i+1]) {
printf("NO\n");
flag = 1;
break;
}
if (!flag)
printf("YES\n");
}
return 0;
}