2-SAT 例题练习记录

UVa1146

---

CODE

#include<bits/stdc++.h>
using namespace std;
#define sf scanf
#define pf printf
const int N=4e3+10;
int low[N],dfn[N],tot=0,CN=0,stk[N],top=0,instk[N],col[N],n;
vector <int> G[N];
void dfs(int u){
	low[u]=dfn[u]=++tot;
	stk[++top]=u;instk[u]=1;
	for(int i=0;i<G[u].size();++i){
		int v=G[u][i];
		if(!dfn[v])dfs(v),low[u]=min(low[u],low[v]);
		else if(instk[v])low[u]=min(low[u],dfn[v]);
	}
	if(low[u]==dfn[u]){
		++CN;
		while(1){
			int t=stk[top--];instk[t]=0;col[t]=CN;
			if(t==u)break;
		}
	}
}
struct node{
	int l,r;
}t[N];
inline bool check(int k){
	for(int i=1;i<=2*n;++i){
		G[i].clear();tot=0;top=0;col[i]=dfn[i]=low[i]=0;CN=0;
	}
	for(int i=1;i<n;++i){
		for(int j=i+1;j<=n;++j){
			if(abs(t[i].l-t[j].l)<k)G[i].push_back(j+n),G[j].push_back(i+n);
			if(abs(t[i].l-t[j].r)<k)G[i].push_back(j),G[j+n].push_back(i+n);
			if(abs(t[i].r-t[j].l)<k)G[i+n].push_back(j+n),G[j].push_back(i);
			if(abs(t[i].r-t[j].r)<k)G[i+n].push_back(j),G[j+n].push_back(i);
		}
	}
	for(int i=1;i<=n*2;++i)if(!dfn[i])dfs(i);
	for(int i=1;i<=n;++i){
		if(col[i]==col[i+n])return 0;
	}
	return 1;
}
signed main(){
	while(~sf("%d",&n)){
		for(int i=1;i<=n;++i)
			sf("%d%d",&t[i].l,&t[i].r);
		int l=0,r=1e8,mid;
		while(l+1<r){
			mid=(l+r)>>1;
			if(check(mid))l=mid;
			else r=mid;
		}
		if(check(r))cout<<r<<'\n';
		else cout<<l<<'\n';
	}
	return 0;

---

POJ3207

---

CODE

#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
#define sf scanf
#define pf printf
const int N=1e4+10;
int low[N],dfn[N],tot=0,CN=0,stk[N],top=0,instk[N],col[N],n,m,vis[N];
vector <int> G[N];
void dfs(int u){
	low[u]=dfn[u]=++tot;
	stk[++top]=u;instk[u]=1;
	for(int i=0;i<G[u].size();++i){
		int v=G[u][i];
		if(!dfn[v])dfs(v),low[u]=min(low[u],low[v]);
		else if(instk[v])low[u]=min(low[u],dfn[v]);
	}
	if(low[u]==dfn[u]){
		++CN;
		while(1){
			int ti=stk[top--];instk[ti]=0;col[ti]=CN;
			if(ti==u)break;
		}
	}
}
struct node{
	int l,r;
}t[N];
inline bool check(node a,node b){
	if(a.l>b.l)swap(a,b);
	if(b.l>a.r)return 1;
	if(b.r<a.r)return 1;
	return 0;
}

signed main(){
	sf("%d%d",&n,&m);
	for(int i=1;i<=m;++i){
		sf("%d%d",&t[i].l,&t[i].r);
		if(t[i].l>t[i].r)swap(t[i].l,t[i].r);
		++vis[t[i].l];++vis[t[i].r];
	}	
	for(int i=0;i<n;++i){
		if(vis[i]>1){
			cout<<"the evil panda is lying again";
			return 0;
		}
	}
	for(int i=1;i<m;++i){
		for(int j=i+1;j<=m;++j){
			if(!check(t[i],t[j])){
				G[i].push_back(j+m);G[j].push_back(i+m);
				G[i+m].push_back(j);G[j+m].push_back(i);
			}
		}
	}	
	for(int i=1;i<=m*2;++i)if(!dfn[i])dfs(i);
	for(int i=1;i<=m;++i){
		if(col[i]==col[i+m]){
			cout<<"the evil panda is lying again";	
			return 0;
		}
	}
	cout<<"panda is telling the truth...";
	return 0;
}

POJ2723

---

CODE

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
#define sf scanf
#define pf printf
const int N=3e3+10;
int low[N],dfn[N],tot=0,CN=0,stk[N],top=0,instk[N],col[N],n,m,par[N];
vector <int> G[N];
void dfs(int u){
	low[u]=dfn[u]=++tot;
	stk[++top]=u;instk[u]=1;
	for(int i=0;i<G[u].size();++i){
		int v=G[u][i];
		if(!dfn[v])dfs(v),low[u]=min(low[u],low[v]);
		else if(instk[v])low[u]=min(low[u],dfn[v]);
	}
	if(low[u]==dfn[u]){
		++CN;
		while(1){
			int t=stk[top--];instk[t]=0;col[t]=CN;
			if(t==u)break;
		}
	}
}
inline bool run(){
	tot=0;CN=0;top=0;for(int i=1;i<=n*2;++i)low[i]=dfn[i]=col[i]=0;
	for(int i=1;i<=n*2;++i)if(!dfn[i])dfs(i);
	for(int i=1;i<=n*2;++i){
		if(col[i]==col[par[i]])return 0;
	}
	return 1;
}
signed main(){
	while(sf("%d%d",&n,&m) && n && m){
		bool flag=0;
		for(int i=1;i<=n*2;++i)G[i].clear();
		for(int i=1;i<=n;++i){
			int a,b;sf("%d%d",&a,&b);
			++a;++b;par[a]=b;par[b]=a;
		}
		for(int i=1;i<=m;++i){
			int x,y;sf("%d%d",&x,&y);
			++x;++y;
			G[par[x]].push_back(y);G[par[y]].push_back(x);
			if(!flag){
				if(!run()){
					flag=1;
					cout<<i-1<<'\n';
				}	
			}
		}
		if(!flag)cout<<m<<'\n';
	}

	return 0;
}