POJ 3678 KatuPuzzle 2-SAT模板题

http://www.tuicool.com/articles/Qr6FJf

只对确定的关系建边

#include<stdio.h>
#include<string>
#include<cstring>
#include<queue>
#include<algorithm>
#include<functional>
#include<vector>
#include<iomanip>
#include<math.h>
#include<iostream>
#include<sstream>
#include<stack>
#include<set>
#include<bitset>
using namespace std;

const int MAXN=2005;
const int MAXM=1000005;

int First[MAXN],Next[MAXM],V[MAXM],Cnt;
int N,M;

int Block,Top,id;
int Low[MAXN],Dfn[MAXN],Ins[MAXN];
int St[MAXN],Belong[MAXN],Size[MAXN];

void Init()
{
    Cnt=0;
    memset(First,-1,sizeof(First));
    memset(Next,-1,sizeof(Next));
    Block=Top=id=0;
    memset(Dfn,0,sizeof(Dfn));
    memset(Ins,0,sizeof(Ins));
}

inline void AddEdge(int a,int b)
{
    V[Cnt]=b;
    Next[Cnt]=First[a];
    First[a]=Cnt++;
}

void Tarjan(int u)
{
    Low[u]=Dfn[u]=++id;
    Ins[u]=1;
    St[++Top]=u;
    for (int i=First[u];i!=-1;i=Next[i])
    {
        int v=V[i];
        if (!Dfn[v])
        {
            Tarjan(v);
            Low[u]=min(Low[u],Low[v]);
        }
        else if (Ins[v])
            Low[u]=min(Low[u],Dfn[v]);
    }
    if (Low[u]==Dfn[u])
    {
        Block++;
        int v;
        do
        {
            v=St[Top--];
            Ins[v]=0;
            Belong[v]=Block;
            Size[Block]++;
        }
        while (v!=u);
    }
}

int main()
{
    cin.sync_with_stdio(false);
    while (cin>>N>>M)
    {
        Init();
        int a,b,c;
        char temp[20];
        for (int i=0;i<M;i++)
        {
            cin>>a>>b>>c>>temp;
            if (temp[0]=='A')
            {
                if (c)
                {
                    AddEdge(a*2,a*2+1);
                    AddEdge(b*2,b*2+1);
                }
                else
                {
                    AddEdge(a*2+1,b*2);
                    AddEdge(b*2+1,a*2);
                }
            }
            if (temp[0]=='O')
            {
                if (c)
                {
                    AddEdge(a*2,b*2+1);
                    AddEdge(b*2,a*2+1);
                }
                else
                {
                    AddEdge(a*2+1,a*2);
                    AddEdge(b*2+1,b*2);
                }
            }
            if (temp[0]=='X')
            {
                if (c)
                {
                    AddEdge(a*2,b*2+1);
                    AddEdge(a*2+1,b*2);
                    AddEdge(b*2,a*2+1);
                    AddEdge(b*2+1,a*2);
                }
                else
                {
                    AddEdge(a*2,b*2);
                    AddEdge(a*2+1,b*2+1);
                    AddEdge(b*2,a*2);
                    AddEdge(b*2+1,a*2+1);
                }
            }
        }

        for (int i=0;i<=N*2-1;i++)
            if (!Dfn[i])
                Tarjan(i);
        bool Ans=true;
        for (int i=0;i<N;i++)
            if (Belong[i*2]==Belong[i*2+1])
                Ans=false;
        if (Ans)
            cout<<"YES\n";
        else
            cout<<"NO\n";
    }
    return 0;
}