hdu3062 Party--强连通 & 2-sat & 判断可行性

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=3062

题意：n对夫妻，m对关系，表示该两人之间的仇恨关系，问能否有n人出席。

典型的2-sat问题，若这两人仇恨，就分别把其中一人指向另一人的另一半，看代码就行。

#define _CRT_SECURE_NO_DEPRECATE 

#include<iostream>
#include<vector>
#include<cstring>
#include<queue>
#include<stack>
#include<algorithm>
#define INF 99999999
using namespace std;

int n, m;
int cnt;
int index;
vector<int> vec[2005];
stack<int> s;
int belong[2005];
int dfn[2005];
int low[2005];
bool inStack[2005];

void tarjan(int u)
{
	dfn[u] = low[u] = ++index;
	inStack[u] = 1;
	s.push(u);
	for (int i = 0; i < vec[u].size(); i++)
	{
		int v = vec[u][i];
		if (!dfn[v])
		{
			tarjan(v);
			low[u] = min(low[u], low[v]);
		}
		else if (inStack[v])
			low[u] = min(low[u], dfn[v]);
	}

	if (low[u] == dfn[u])
	{
		int p;
		cnt++;
		do
		{
			p = s.top();
			s.pop();
			inStack[p] = 0;
			belong[p] = cnt;
		} while (p != u);
	}
}

void solve()
{
	cnt = index = 0;
	for (int i = 0; i < 2 * n; i++)
		if (!dfn[i])
			tarjan(i);

	for (int i = 0; i < 2 * n - 1; i = i + 2)
	{
		if (belong[i] == belong[i + 1])
		{
			printf("NO\n");
			return;
		}
	}
	printf("YES\n");
}

int main()
{
	int a1, a2;
	int c1, c2;
	while (~scanf("%d%d", &n, &m))
	{
		//init
		for (int i = 0; i <= 2 * n; i++)
		{
			vec[i].clear();
			dfn[i] = 0;
			inStack[i] = 0;
		}

		for (int i = 0; i < m; i++)
		{
			scanf("%d%d%d%d", &a1, &a2, &c1, &c2);
			int p1 = a1 * 2 + c1;
			int p2 = a2 * 2 + c2;
			vec[p1].push_back(p2 ^ 1);
			vec[p2].push_back(p1 ^ 1);
		}

		solve();
	}
	return 0;
}