2-SAT 模板

2-SAT 问题:

有 n 个变量，每一个变量都是 bool 类型的，除了这 n 个变量以外，我们还有 m 个关系表达式，关系表达式差不多是这样的：

$$x1\&x2=false$$（注意每个表达式只会有两个变量）

问给出 m 个关系表达式后，能否给这 n 个变量找出一个赋值的方法，使得满足所有的表达式；

>face<

前置技能:tarjan求最大连通分量

#include <bits/stdc++.h>
#include <bits/extc++.h>
using namespace std;
#define _rep(n, a, b) for (ll n = (a); n <= (b); ++n)
#define _rev(n, a, b) for (ll n = (a); n >= (b); --n)
#define _for(n, a, b) for (ll n = (a); n < (b); ++n)
#define _rof(n, a, b) for (ll n = (a); n > (b); --n)
#define oo 0x3f3f3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<ll, ll>
const ll mod = 1e9 + 7;
const ll maxn = 2e6 + 5;
struct node
{
	int nxt, to;
} way[maxn];
int cnt, head[maxn], dfn[maxn], tim, low[maxn], vis[maxn], st[maxn], top, scc_sum, scc[maxn];
void addedge(int from, int to)
{
	way[++cnt].to = to;
	way[cnt].nxt = head[from];
	head[from] = cnt;
}
int n, m;
void tarjan(int cur, int fa)
{ //求强连通分量
	dfn[cur] = low[cur] = ++tim;
	st[++top] = cur;
	vis[cur] = 1;
	for (int i = head[cur]; i; i = way[i].nxt)
	{
		int to = way[i].to;
		if (to == fa)
			continue;
		if (!dfn[to])
		{
			tarjan(to, cur);
			low[cur] = min(low[cur], low[to]);
		}
		else if (vis[to])
			low[cur] = min(low[cur], dfn[to]);
	}
	if (dfn[cur] == low[cur])
	{
		scc_sum++;
		while (st[top] != cur)
		{
			scc[st[top]] = scc_sum;
			vis[st[top--]] = 0;
		}
		scc[st[top]] = scc_sum;
		vis[st[top--]] = 0;
	}
}
signed main()
{
	
	cin >> n >> m;
	_rep(i, 1, m)
	{
		int a, val_a, b, val_b;
		cin >> a >> val_a >> b >> val_b;
		addedge(b + (1 ^ val_b) * n, a + val_a * n);
		addedge(a + (val_a ^ 1) * n, b + val_b * n);
	}
	_rep(i, 1, 2 * n)
	{
		if (!dfn[i])
			tarjan(i, 0);
	}
	_rep(i, 1, n)
	{
		if (scc[i] == scc[i + n])
		{ //两种取值在同一连通分量中
			return puts("IMPOSSIBLE"), 0;
		}
	}
	puts("POSSIBLE");
	_rep(i, 1, n)
	{
		if (scc[i] > scc[i + n])
			cout << 1 << " "; //强连通分量编号越小, top序越大, 就越优
		else
			cout << 0 << " ";
	}
}