bzoj1823 [JSOI2010]满汉全席（2-sat）

挺裸的2-sat

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <stack>
using namespace std;
#define inf 0x3f3f3f3f
#define N 110
#define ll long long
inline char gc(){
    static char buf[1<<16],*S,*T;
    if(S==T){T=(S=buf)+fread(buf,1,1<<16,stdin);if(T==S) return EOF;}
    return *S++;
}
int n,m,id[N][2],tot,h[N<<1],num=0;
int bel[N<<1],dfn[N<<1],low[N<<1],dfnum=0,scc=0;
bool inq[N<<1];stack<int>qq;
inline int read(){
    int x=0,f=-1;char ch=gc();
    while(ch<'0'||ch>'9'){if(ch=='m') f=0;if(ch=='h') f=1;ch=gc();}
    while(ch>='0'&&ch<='9') x=x*10+ch-'0',ch=gc();
    return f==-1?x:id[x][f];
}
struct edge{
    int to,next;
}data[2010];
inline void add(int x,int y){
    data[++num].to=y;data[num].next=h[x];h[x]=num;
}
inline void tarjan(int x){
    dfn[x]=low[x]=++dfnum;qq.push(x);inq[x]=1;
    for(int i=h[x];i;i=data[i].next){
        int y=data[i].to;
        if(!dfn[y]) tarjan(y),low[x]=min(low[x],low[y]);
        else if(inq[y]) low[x]=min(low[x],dfn[y]);
    }if(low[x]==dfn[x]){
        ++scc;while(1){
            int y=qq.top();qq.pop();inq[y]=0;
            bel[y]=scc;if(y==x) break;
        }
    }
}
int main(){
//  freopen("a.in","r",stdin);
    int tst=read();
    while(tst--){
        n=read();m=read();tot=-1;memset(h,0,sizeof(h));num=0;
        memset(dfn,0,sizeof(dfn));dfnum=0;scc=0;
        for(int i=1;i<=n;++i) id[i][0]=++tot,id[i][1]=++tot;
        while(m--){
            int x=read(),y=read();add(x^1,y);add(y^1,x);
        }for(int i=0;i<=tot;++i) if(!dfn[i]) tarjan(i);bool flag=0;
        for(int i=1;i<=n;++i)
            if(bel[id[i][0]]==bel[id[i][1]]){flag=1;break;}
        puts(flag?"BAD":"GOOD");
    }return 0;
}