【hdu3062】【2-sat】Party

2-sat的入门题吧，只需要按照题意建图就好。

判定是否有解是2-sat的题型之一。

#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 2000 + 10;
const int maxm = maxn * maxn;
struct Edge
{
	int pos;
	int next;
}E[maxm];
int head[maxn];
int dfn[maxn],low[maxn],stack[maxn],belong[maxn];
bool instack[maxn];
int step,stop,NE;
int n,m,cnt;
void init()
{
	freopen("hdu3062.in","r",stdin);
	freopen("hdu3062.out","w",stdout);
}

void Init()
{
	memset(head,-1,sizeof(head));
	memset(dfn,0,sizeof(dfn));
	memset(low,0,sizeof(low));
	memset(stack,0,sizeof(stack));
	memset(belong,0,sizeof(belong));
	memset(instack,false,sizeof(instack));
	step = stop = cnt = NE = 0;
}

void add(int u,int v)
{
	E[NE].pos = v;
	E[NE].next = head[u];head[u] = NE++;
}

void tarjan(int u)
{
	dfn[u] = low[u] = step++;
	stack[stop++] = u;
	instack[u] = true;
	for(int i = head[u];i != -1;i = E[i].next)
	{
		int v = E[i].pos;
		if(!dfn[v])
		{
			tarjan(v);
			if(low[v] < low[u])low[u] = low[v];
		}
		else if(instack[v] && dfn[v] < low[u])low[u] = dfn[v];
	}
	if(dfn[u] == low[u])
	{
		++cnt;
		int tmp;
		do
		{
			tmp = stack[--stop];
			instack[tmp] = false;
			belong[tmp] = cnt;
		}while(u != tmp);
	}
}

void readdata()
{
	while(scanf("%d%d",&n,&m) != EOF)
	{
		Init();
		for(int i = 1;i <= m;i++)
		{
			int a,b,c,d;
			scanf("%d%d%d%d",&a,&b,&c,&d);
			add(2 * a + c,2 * b + 1 - d);
			add(2 * b + d,2 * a + 1 - c);
		}
		for(int i = 0;i < 2 * n;i++)
		{
			if(!dfn[i])tarjan(i);
		}
		bool flag = true;
		for(int i = 0;i < n;i++)
		{
			if(belong[2 * i] == belong[2 * i + 1])
			{
				flag = false;
				break;
			}
		}
		puts(flag ? "YES" : "NO");
	}	
}

int main()
{
	init();
	readdata();
	return 0;
}