hdu 4115

简单2-sat

方法一：找到矛盾项（选x不能选y）

若c == 0{   //第u次与第v次相同

            if(a[u] != a[v]) g[u].push_back(v+n),g[v].push_back(u+n);

            if(a[u] != b[v]) g[u].push_back(v),g[v+n].push_back(u+n);

            if(b[u] != a[v]) g[u+n].push_back(v+n),g[v].push_back(u);

            if(b[u] != b[v]) g[u+n].push_back(v),g[v+n].push_back(u);

}else{

            if(a[u]==a[v]) g[u].push_back(v+n),g[v].push_back(u+n);

            if(a[u]==b[v]) g[u].push_back(v),g[v+n].push_back(u+n);

            if(b[u]==a[v]) g[u+n].push_back(v+n),g[v].push_back(u);

            if(b[u]==b[v]) g[u+n].push_back(v),g[v+n].push_back(u);

}

方法二：找到依赖项（选x必须y）

#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#define N 10010
using namespace std;
int a[N],b[N][2];
struct Edge{
    int v,next;
}edge[N*4];
int head[N*2],cnt,scc,top,Index;
int dfn[N*2],low[N*2],instack[N*2],sstack[N*2],belong[N*2];
void addedge(int u,int v){
    edge[cnt].v=v;
    edge[cnt].next=head[u];
    head[u]=cnt++;
}
void tarjan(int u){
    dfn[u]=low[u]=++Index;
    sstack[++top]=u;
    instack[u]=1;
    for(int i=head[u];i!=-1;i=edge[i].next){
        int v=edge[i].v;
        if(dfn[v]==0){
            tarjan(v);
            low[u]=min(low[v],low[u]);
        }
        else if(instack[v])
            low[u]=min(low[u],dfn[v]);
    }
    if(dfn[u]==low[u]){
        scc++;
        while(1){
            int tmp=sstack[top--];
            instack[tmp]=0;
            belong[tmp]=scc;
            if(tmp==u)break;
        }
    }
}
void init(){
    memset(head,-1,sizeof(head));
    cnt=Index=top=scc=0;
    memset(instack,0,sizeof(instack));
    memset(dfn,0,sizeof(dfn));
}
int main(){
    int t,T;
    int i,j;
    int u,v,w;
    int n,m;
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    scanf("%d",&T);
    for(t=1;t<=T;t++){
        scanf("%d %d",&n,&m);
        init();
        for(i=1;i<=n;i++){
            scanf("%d",&a[i]);
            if(a[i]==1)b[i][0]=1,b[i][1]=2;
            else if(a[i]==2)b[i][0]=2,b[i][1]=3;
            else b[i][0]=3,b[i][1]=1;
        }
        for(i=1;i<=m;i++){
            scanf("%d %d %d",&u,&v,&w);
            if(w==1){
                if(b[u][0]==b[v][0]){
                    addedge(u*2-1,v*2);
                    addedge(v*2-1,u*2);
                }
                else if(b[u][0]==b[v][1]){
                    addedge(u*2-1,v*2-1);
                    addedge(v*2,u*2);
                }
                if(b[u][1]==b[v][0]){
                    addedge(u*2,v*2);
                    addedge(v*2-1,u*2-1);
                }
                else if(b[u][1]==b[v][1]){
                    addedge(u*2,v*2-1);
                    addedge(v*2,u*2-1);
                }
            }
            else{
                if(b[u][0]==b[v][0]){
                    addedge(u*2-1,v*2-1);
                    addedge(v*2-1,u*2-1);
                }
                else if(b[u][0]==b[v][1]){
                    addedge(u*2-1,v*2);
                    addedge(v*2,u*2-1);
                }
                else
                    addedge(u*2-1,u*2);
                if(b[u][1]==b[v][0]){
                    addedge(u*2,v*2-1);
                    addedge(v*2-1,u*2);
                }
                else if(b[u][1]==b[v][1]){
                    addedge(u*2,v*2);
                    addedge(v*2,u*2);
                }
                else
                    addedge(u*2,u*2-1);
                if(b[v][0]!=b[u][0] && b[v][0]!=b[u][1])
                    addedge(v*2-1,v*2);
                if(b[v][1]!=b[u][0] && b[v][1]!=b[u][1])
                    addedge(v*2,v*2-1);
            }
        }
        for(i=1;i<=2*n;i++){
            if(!dfn[i])
                tarjan(i);
        }
        bool flag=1;
        for(i=1;i<=n;i++)
            if(belong[i*2-1]==belong[i*2]){
                flag=0;
                break;
            }
        if(flag)printf("Case #%d: yes\n",t);
        else printf("Case #%d: no\n",t);
    }
}