P4782 2-SAT模版

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int n , m;
int head[2000005], cnt;
struct node{
    int t ,next;
}edge[2000005*2];
int opp(int x)
{
    if(x <= n)
        return x + n;
    return x - n;
}
void add(int f , int t)
{
    edge[cnt].t = t;
    edge[cnt].next = head[f];
    head[f] = cnt ++;
}
int times , tot;
int dfn[2000005] , low[2000005], vis[2000005], st[2000005], scc[2000005], type = 0;
void tarjan(int u)
{
    dfn[u] = low[u] = ++ times;
    st[++ tot] = u;
    vis[u] = 1;
    for(int i = head[u] ; i != -1 ; i = edge[i].next)
    {
        if(!dfn[edge[i].t])
        {
            tarjan(edge[i].t);
            low[u] = min(low[u],low[edge[i].t]);
        }
        else if(vis[edge[i].t])
            low[u] = min(low[u],dfn[edge[i].t]);
    }
    if(low[u] == dfn[u])
    {
        type ++;
        do
        {
            scc[st[tot]] = type;
            vis[st[tot]] = 0;
            tot --;
        }while(u != st[tot+1]);
    }
    return ;
}
int main(void)
{
    mem(head,-1);
    scanf("%d %d",&n,&m);
    for(int i = 1 ; i <= m ; i ++)
    {
        int u, a, v ,b;
        scanf("%d %d %d %d",&u,&a,&v,&b);
        if(a == 0) u = opp(u);
        if(b == 0) v = opp(v);
        add(opp(u),v);
        add(opp(v),u);
    }
    for(int i = 1 ; i <= 2*n ; i ++)
        if(!dfn[i])
            tarjan(i);
    for(int i = 1 ; i <= n  ; i ++)
    {
        if(scc[i] == scc[opp(i)])
        {
            cout<<"IMPOSSIBLE"<<endl;
            return 0;
        }
    }
    cout<<"POSSIBLE"<<endl;
    for(int i = 1; i <= n ; i ++) {
        if (scc[i] < scc[opp(i)])
            cout << 1 << " ";
        else
            cout << 0 << " ";
    }
}