POJ 3678 Katu Puzzle (2-SAT)
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 11429 | Accepted: 4233 |
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 Vi a value Xi (0 ≤ Xi ≤ 1) such that for each edge e(a, b) labeled by op and c, the following formula holds:
Xa op Xb = c
The calculating rules are:
|
|
|
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
#include<iostream>
#include<vector>
#include<stack>
#include<cstdio>
using namespace std;
int n,m;
vector<int>u[200024];
stack<int>st;
int dfn[200024],sig,low[200024],color[20024],index;
bool book[200024];
void init()
{
scanf("%d%d",&n,&m);
char s[10];
int x,y,c;
for(int i=1;i<=m;i++){
scanf("%d%d%d",&x,&y,&c);
scanf("%s",s);
if(s[0]=='A'){
if(c==1){
u[y].push_back(y+n);//不理解
u[x].push_back(x+n);//不理解
}
if(c==0){
u[x+n].push_back(y);
u[y+n].push_back(x);
}
}
else if(s[0]=='X'){
if(c==1){
u[x+n].push_back(y);
u[x].push_back(y+n);
u[y+n].push_back(x);
u[y].push_back(x+n);
}
if(c==0){
u[x+n].push_back(y+n);
u[x].push_back(y);
u[y+n].push_back(x+n);
u[y].push_back(x);
}
}
else if(s[0]=='O'){
if(c==1){
u[x].push_back(y+n);
u[y].push_back(x+n);
}
if(c==0){
u[y+n].push_back(y);//不理解
u[x+n].push_back(x);//不理解
}
} }
} void tarjan(int t)
{
dfn[t]=low[t]=++index;
book[t]=true;
st.push(t);
int siz=u[t].size();
for(int i=0;i<siz;i++){
if(!dfn[u[t][i]]){
tarjan(u[t][i]);
low[t]=min(low[t],low[u[t][i]]);
}
if(book[u[t][i]]){
low[t]=min(low[t],low[u[t][i]]);
}
}
int miui;
if(dfn[t]==low[t]){
sig++;
while(true){
if(st.empty()){break;}
miui=st.top();
st.pop();
book[miui]=false;
color[miui]=sig;
if(miui==t){break;}
}
}
} bool solve()
{
for(int i=0;i<n;i++){
if(!dfn[i]){
tarjan(i);
}
} for(int i=0;i<n;i++){
if(color[i]==color[i+n]&&color[i]!=0){
return false;
}
}
return true;
} int main()
{
init();
if(solve()){
printf("YES\n");
}
else printf("NO\n");
}
POJ 3678 Katu Puzzle (2-SAT)的更多相关文章
- POJ 3678 Katu Puzzle(2 - SAT) - from lanshui_Yang
Description Katu Puzzle is presented as a directed graph G(V, E) with each edge e(a, b) labeled by a ...
- POJ 3678 Katu Puzzle (经典2-Sat)
Katu Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6553 Accepted: 2401 Descr ...
- POJ 3678 Katu Puzzle(强连通 法)
题目链接 题意:给出a, b, c 和操作类型 (与或异或),问是否满足所有的式子 主要是建图: 对于 and , c == 1: 说明 a 和 b都是1,那么 0 就不能取, a' -> a ...
- POJ 3678 Katu Puzzle(2-SAT,合取范式大集合)
Katu Puzzle Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9987 Accepted: 3741 Descr ...
- POJ 3678 Katu Puzzle (2-SAT,常规)
题意:给出n个点,每个点上有一个数字可以0或1,然后给出m条限制,要求a和b两个点上的数字满足 a op b = c,op和c都是给定.问是否能够有一组解满足所有限制?(即点上的数字是0是1由你决定) ...
- poj 3678 Katu Puzzle(2-sat)
Description Katu Puzzle ≤ c ≤ ). One Katu ≤ Xi ≤ ) such that for each edge e(a, b) labeled by op and ...
- poj 3678 Katu Puzzle 2-SAT 建图入门
Description Katu Puzzle is presented as a directed graph G(V, E) with each edge e(a, b) labeled by a ...
- poj 3678 Katu Puzzle(Two Sat)
题目链接:http://poj.org/problem?id=3678 代码: #include<cstdio> #include<cstring> #include<i ...
- POJ 3678 Katu Puzzle 2-SAT 强连通分量 tarjan
http://poj.org/problem?id=3678 给m条连接两个点的边,每条边有一个权值0或1,有一个运算方式and.or或xor,要求和这条边相连的两个点经过边上的运算后的结果是边的权值 ...
随机推荐
- Git拉取项目时报错“remote: HTTP Basic: Access denied”解决方法
问题: Git拉取项目时报错“remote: HTTP Basic: Access denied”,此问题多为本地密码与远端密码不符导致. 解决方法: 在下载地址中加上用户名和密码即可,如下: htt ...
- Lodop打印维护PRINT_SETUP本地缓存ini文件
针对千差万别的客户端,Lodop提供了打印维护(PRINT_SETUP),可以针对某个客户端微调,调整结果保存在客户端本地,不会影响其他访问网站的用户的使用. 打印维护使用方法:1.PRINT_INI ...
- linq之左连接 + group by
var list = from item in (from s in _sysBll.GetList(s => s.ParamID == "TraSchType" & ...
- MyBatis实操进阶版(一)
MyBatis实操进阶版(一) 目前而言,持久层框架中,在业务实现灵活性上,无可出MyBatis之右者.具体原因,后续将逐步展开 ResultMap元素的设置 配置文件中,ResultMap元素的作用 ...
- python 模块之-json
python 模块json import json x="[null,true,false,1]" print(json.loads(x)) #---------------- ...
- Python中的urllib2模块解析
Name urllib2 - An extensible library for opening URLs using a variety of protocols 1. Description Th ...
- Django+Xadmin打造在线教育系统(三)
完成登录 注册 找回密码 激活 验证码集成 将HTML文件拷贝到templates目录下,css,js,img,media,images文件夹拷贝到static文件夹下 修改index.html和lo ...
- MT【301】值域宽度
(2015浙江理科)已知函数$f(x)=x^2+ax+b,(a,b\in R)$.记$M(a,b)$是$|f(x)|$在区间$[-1,1]$上的最大值.(1)证明:当$|a|\ge2$时,$M(a,b ...
- Centos7 Install Kubernetes
环境搭建配置官方 k8s yum 源: cat <<EOF > /etc/yum.repos.d/virt7-docker-common-release.repo [virt7-do ...
- 利用纯粹的CSS3替代小图标---向右箭头
1.向右的箭头> . 看到很多网站里面向右的箭头都是图片代替的,但是为了网站的性能,我们一般的原则是能够避免使用图片的尽量不用图片 比如看下携程个人中心首页面,向右的箭头 其实现思路是这样 ...