POJ 3678 2-sat

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;

const int SIZE = 2010;
int n, m;

int head[SIZE], E;
bool instk[SIZE];
int stk[SIZE], top;
int blk[SIZE], blkCnt;
int low[SIZE], dfn[SIZE], tim;
struct EDGE { int v, next; } edge[SIZE*1000];

void init()
{
    E = top = blkCnt = tim = 0;
    for(int i = 0; i < n + n; i++)
    {
        head[i] = blk[i] = low[i] = dfn[i] = -1;
        instk[i] = false;
    }
}

void add(int u, int v)
{
    edge[E].v = v;
    edge[E].next = head[u];
    head[u] = E++;
}


void tarjan(int u)
{
    int v;
    instk[u] = true;
    stk[top++] = u;
    low[u] = dfn[u] = tim++;
    for(int i = head[u]; i != -1; i = edge[i].next)
    {
        v = edge[i].v;
        if(dfn[v] == -1)
        {
            tarjan(v);
            low[u] = min(low[u], low[v]);
        }
        else if(instk[v])
            low[u] = min(low[u], dfn[v]);
    }

    if(low[u] == dfn[u])
    {
        if(top == -1 || top == 0) return;
        do
        {
            v = stk[top-1];
            top--;
            instk[v] = false;
            blk[v] = blkCnt;
        } while(v != u);
        blkCnt++;
    }
}

void buildmap()
{
    char op[5];
    int i, a, b, c;
    for(i = 0; i < m; i++)
    {
        scanf("%d %d %d %s",&a,&b,&c,op);
        if(op[0] == 'A')
        {
            if(c == 1)
            {
                add(a, a+n);
                add(b, b+n);
                add(a+n, b+n);
                add(b+n, a+n);
            }
            else
            {
                add(a+n, b);
                add(b+n, a);
            }
        }
        else if(op[0] == 'O')
        {
            if(c == 1)
            {
                add(a, b+n);
                add(b, a+n);
            }
            else
            {
                add(a, b);
                add(b, a);
                add(a+n, a);
                add(b+n, b);
            }
        }
        else if(op[0] == 'X')
        {
            if(c == 1)
            {
                add(a, b+n);
                add(b, a+n);
                add(a+n, b);
                add(b+n, a);
            }
            else
            {
                add(a, b);
                add(b, a);
                add(a+n, b+n);
                add(b+n, a+n);
            }
        }
    }
}

int main()
{
    while(scanf("%d%d",&n,&m) != EOF)
    {
        init();
        buildmap();

        int i;
        for(i = 0; i < n + n; i++)
            if(dfn[i] == -1) tarjan(i);

        for(i = 0; i < n; i++)
            if(blk[i] == blk[i+n]) break;

        if(i == n) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}