poj 3678 2SAT+挑战板子

AC_Lee

于 2017-07-29 23:33:44 发布

阅读量449

点赞数

分类专栏：搜索&图论

本文链接：https://blog.csdn.net/xiaoli_nu/article/details/76359463

版权

搜索&图论专栏收录该内容

59 篇文章 0 订阅

订阅专栏

题目：

Katu Puzzle

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 10066		Accepted: 3768

Description

Katu Puzzle is presented as a directed graph G(V, E) with each edge e(a, b) labeled by a boolean operator op (one of AND, OR, XOR) and an integer c (0 ≤ c ≤ 1). One Katu is solvable if one can find each vertex V_i a value X_i (0 ≤ X_i≤ 1) such that for each edge e(a, b) labeled by op and c, the following formula holds:

X_a op X_b = c

The calculating rules are:

AND	0	1
0	0	0
1	0	1

OR	0	1
0	0	1
1	1	1

XOR	0	1
0	0	1
1	1	0

Given a Katu Puzzle, your task is to determine whether it is solvable.

Input

The first line contains two integers N (1 ≤ N ≤ 1000) and M,(0 ≤ M ≤ 1,000,000) indicating the number of vertices and edges.
The following M lines contain three integers a (0 ≤ a < N), b(0 ≤ b < N), c and an operator op each, describing the edges.

Output

Output a line containing "YES" or "NO".

Sample Input

4 4
0 1 1 AND
1 2 1 OR
3 2 0 AND
3 0 0 XOR

Sample Output

YES

Hint

X ₀ = 1, X ₁ = 1, X ₂ = 0, X ₃ = 1.

Source

POJ Founder Monthly Contest – 2008.07.27, Dagger

分析：

关键在建图啦建图参：http://www.hankcs.com/program/algorithm/poj-3678-katu-puzzle.html

上面链接有个表格不错不过有两行可能不太容易理解

A AND B = 1 => !A->A && !B->B 这里要用到一个叫做皮尔斯定理的东东大体意思就是说 x=1 <==> !x->x

同理，x=0 <==> x->!x

代码：

///建图下标0->n-1 + n->2n-1
#include<iostream>
#include<string.h>
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
const int maxn=1010;
const int maxv=2030;

int n,m;
int v,belong[maxv];///顶点数 所属强连通分量拓扑序
vector<int> g[maxv];
vector<int> rg[maxv];///反向图
int vs[maxv],num;///后序遍历顶点标号 下标num属于0 - v-1
bool used[maxv];

inline void adde(int a,int b){///a->b
    g[a].push_back(b); rg[b].push_back(a);
}

inline void dfs(int v){
    used[v]=1;
    for(int i=0;i<g[v].size();++i)  if(!used[g[v][i]]) dfs(g[v][i]);
    vs[num++]=v;
}

inline void rdfs(int v,int k){
    used[v]=1;
    belong[v]=k;
    for(int i=0;i<rg[v].size();++i)  if(!used[rg[v][i]]) rdfs(rg[v][i],k);
}

int scc(){///返回缩点之后点数
    memset(used,0,sizeof(used));
    num=0;
    for(int i=0;i<v;++i) if(!used[i]) dfs(i);///得到后序标号
    memset(used,0,sizeof(used));
    int k=0;
    for(int i=v/*num*/-1;i>=0;--i) if(!used[vs[i]]) rdfs(vs[i],k++);
    return k;
}

int main(){///1116K	172MS
    int q,w,e;
    char r[5];
    scanf("%d%d",&n,&m);
    v=n*2;
    for(int i=0;i<m;++i){
        scanf("%d %d %d %s",&q,&w,&e,r);///q w 本来就是从0开始的
        ///printf("%d %d %d %s\n",q,w,e,r);
        if(r[0]=='A'){
            if(e==1){
                adde(q+n,q); adde(w+n,w);
            }
            else {
                adde(q,w+n); adde(w,q+n);
            }
        }
        else if(r[0]=='O'){
            if(e==1){
                adde(q+n,w); adde(w+n,q);
            }
            else {
                adde(q,q+n); adde(w,w+n);
            }
        }
        else if(r[0]=='X'){
            if(e==1){
                adde(q,w+n); adde(w,q+n); adde(q+n,w); adde(w+n,q);
            }
            else {
                adde(q,w); adde(w,q); adde(q+n,w+n); adde(w+n,q+n);
            }
        }
    }
    scc();
    int f=1;
    for(int i=0;i<n;++i){
        if(belong[i]==belong[n+i]){
            f=0; printf("NO\n"); break;///就是因为少写了个break,wa到死....
        }
    }
    if(f) printf("YES\n");
    return 0;
}