【图论】2-SAT

模板：洛谷P4782

#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define endl '\n'
#define eps 0.000000001
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))
#define IO ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int INF=0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;
const int maxn=2e6+5;
int tot,head[maxn];
struct E{
	int to,next;
}edge[maxn<<1];
void add(int u,int v){
	edge[tot].to=v;
	edge[tot].next=head[u];
	head[u]=tot++;
}
int n,m;
int dfn[maxn],low[maxn],id[maxn],vis[maxn],cnt,tott;
stack<int> s;
void tarjan(int x){
	dfn[x]=low[x]=++tott;
	s.push(x);vis[x]=1;
	for(int i=head[x];i!=-1;i=edge[i].next){
		int v=edge[i].to;
		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]){
		++cnt;
		while(1){
			int now=s.top();s.pop();
			id[now]=cnt;
			vis[now]=0;
			if(x==now) break;
		}
	}
}
int main(){
	scanf("%d%d",&n,&m);mem(head,-1),cnt=tott=0;
	rep(i,1,m){
		int a,va,b,vb;
		scanf("%d%d%d%d",&a,&va,&b,&vb);
		if(va&&vb){
			add(a+n,b);
			add(b+n,a);
		}
		else if(!va&&vb){
			add(a,b);
			add(b+n,a+n);
		}
		else if(va&&!vb){
			add(a+n,b+n);
			add(b,a);
		}
		else if(!va&&!vb){
			add(a,b+n);
			add(b,a+n);
		}
		/*
		int nota=va^1,notb=vb^1;
		add(a+n*va,b+n*notb);
		add(b+n*vb,a+n*nota);
		*/
	}
	rep(i,1,2*n){
		if(!dfn[i]) tarjan(i);
	}
	rep(i,1,n){
		if(id[i]==id[i+n]){
			puts("IMPOSSIBLE");
			return 0;
		}
	}
	puts("POSSIBLE");
	rep(i,1,n){
		if(id[i]<id[i+n]) printf("1 ");
		else printf("0 ");
	}
	puts("");
}

洛谷P4171

#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,n) for(int i=a;i<=n;i++)
#define per(i,n,a) for(int i=n;i>=a;i--)
#define endl '\n'
#define eps 0.000000001
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))
#define IO ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
const int INF=0x3f3f3f3f;
const ll inf=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;
const int maxn=1e4+5;
int tot,head[maxn];
struct E{
	int to,next;
}edge[maxn<<1];
void add(int u,int v){
	edge[tot].to=v;
	edge[tot].next=head[u];
	head[u]=tot++;
}
int n,m;
int dfn[maxn],low[maxn],id[maxn],vis[maxn],cnt,tott;
stack<int> s;
void tarjan(int x){
	dfn[x]=low[x]=++tott;
	s.push(x);vis[x]=1;
	for(int i=head[x];i!=-1;i=edge[i].next){
		int v=edge[i].to;
		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]){
		++cnt;
		while(1){
			int now=s.top();s.pop();
			id[now]=cnt;
			vis[now]=0;
			if(x==now) break;
		}
	}
}
int main(){
	int T;cin>>T;;
	int cur=0;
	while(T--){
		cin>>n>>m;mem(head,-1);tott=cnt=0;
		mem(id,0);mem(dfn,0);mem(low,0);
		rep(i,1,m){
			char a,b;int pa,pb;
			cin>>a>>pa>>b>>pb;
			int aval,bval,nota,notb;
			if(a=='h') aval=1;
			else aval=0;
			if(b=='h') bval=1;
			else bval=0;
			nota=aval^1;notb=bval^1;
			add(pa+nota*n,pb+bval*n);
			add(pb+notb*n,pa+aval*n);
		}
		rep(i,1,2*n){
			if(!dfn[i]) tarjan(i);
		}
		int flag=0;
		rep(i,1,n){
			if(id[i]==id[i+n]){
				flag=1;break;
			}
		}
		if(flag) puts("BAD");
		else puts("GOOD");
	}
}