【POJ1417】【带标记并查集+DP】True Liars
Description
In order to prevent the worst-case scenario, Akira should distinguish the devilish from the divine. But how? They looked exactly alike and he could not distinguish one from the other solely by their appearances. He still had his last hope, however. The members of the divine tribe are truth-tellers, that is, they always tell the truth and those of the devilish tribe are liars, that is, they always tell a lie.
He asked some of them whether or not some are divine. They knew one another very much and always responded to him "faithfully" according to their individual natures (i.e., they always tell the truth or always a lie). He did not dare to ask any other forms of questions, since the legend says that a devilish member would curse a person forever when he did not like the question. He had another piece of useful informationf the legend tells the populations of both tribes. These numbers in the legend are trustworthy since everyone living on this island is immortal and none have ever been born at least these millennia.
You are a good computer programmer and so requested to help Akira by writing a program that classifies the inhabitants according to their answers to his inquiries.
Input
n p1 p2
xl yl a1
x2 y2 a2
...
xi yi ai
...
xn yn an
The first line has three non-negative integers n, p1, and p2. n is the number of questions Akira asked. pl and p2 are the populations of the divine and devilish tribes, respectively, in the legend. Each of the following n lines has two integers xi, yi and one word ai. xi and yi are the identification numbers of inhabitants, each of which is between 1 and p1 + p2, inclusive. ai is either yes, if the inhabitant xi said that the inhabitant yi was a member of the divine tribe, or no, otherwise. Note that xi and yi can be the same number since "are you a member of the divine tribe?" is a valid question. Note also that two lines may have the same x's and y's since Akira was very upset and might have asked the same question to the same one more than once.
You may assume that n is less than 1000 and that p1 and p2 are less than 300. A line with three zeros, i.e., 0 0 0, represents the end of the input. You can assume that each data set is consistent and no contradictory answers are included.
Output
Sample Input
2 1 1
1 2 no
2 1 no
3 2 1
1 1 yes
2 2 yes
3 3 yes
2 2 1
1 2 yes
2 3 no
5 4 3
1 2 yes
1 3 no
4 5 yes
5 6 yes
6 7 no
0 0 0
Sample Output
no
no
1
2
end
3
4
5
6
end
Source
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <vector>
#include <utility>
#include <iomanip>
#include <string>
#include <cmath>
#include <queue>
#include <map>
#define LOCAL
const int MAXN = + ;
const int MAX = + ;
using namespace std;
struct DATA{
int a, b;
}data[MAXN];
int n, p1, p2, q;
int parent[MAXN] ,val[MAXN];
int num[MAXN];//num[i]代表如果i是并查集中的根,那么他在AB表中的位置就num[i]
int f[MAXN][MAXN], cnt;
int pre[MAXN][MAXN];//DP中记录状态转移过来的位置
int Ans[MAXN];//表示答案中被选为好人或者不是好人 int find(int x){
int f = x, tmp = ;
while (x != parent[x]){
tmp += val[x];
x = parent[x];
}
parent[f] = x;
val[f] = tmp % ;
return x;
} void init(){
n = p1 + p2;//即总的人数
//val为0代表相同集合,1代表不同的集合
for (int i = ; i <= n; i++){
val[i] = ;
parent[i] = i;
}
for (int i = ; i <= q; i++){
int x, y;
char str[];
scanf("%d%d", &x, &y);
scanf("%s", str);
if (find(x) == find(y)) continue;//在同一个集合之内就不用考虑了
else{
if (str[] == 'y'){ //一定是一种集合之内
int xx = find(x), yy = find(y);
parent[xx] = y;
val[xx] = (-val[x] + ) % ;
}else{
int xx = find(x), yy = find(y);
parent[xx] = y;
val[xx] = (-val[x] + ) % ;
}
}
}
}
//计算出各个并查集的同类和不同类
void prepare(){
memset(data, , sizeof(data));
cnt = ;
for (int i = ; i <= n; i++){
if (parent[i] != i) continue;
num[i] = ++cnt;
}
for (int i = ; i <= n; i++){
int xx = find(i);
if (val[i] == ) data[num[xx]].a++;//和它同一类
else data[num[xx]].b++;//不同类
}
}
void dp(){
memset(f, , sizeof(f));
//f[i][j]表示到了第i个好人有j个的时候的方案数量,注意只要保存3个量就可以了
f[][] = ;
for (int i = ; i <= cnt; i++)
for (int j = p1; j >=; j--){
if (j - data[].a >= ) f[i][j] += f[i - ][j - data[i].a];
if (j - data[].b >= ) f[i][j] += f[i - ][j - data[i].b];
if (f[i][j] >= ) f[i][j] = ;//不要做太大了
if (f[i][j] == ){//有解
if (j - data[i].a >= && f[i - ][j - data[i].a] == ) pre[i][j] = ;//a类选为好人
if (j - data[i].b >= && f[i - ][j - data[i].b] == ) pre[i][j] = ;//b类选为好人
}
}
if (f[cnt][p1] != ){printf("no\n");return;}
int last = p1;
for (int i = cnt; i >= ; i--){
Ans[i] = pre[i][last];
if (Ans[i] == ) last -= data[i].a;
else last -= data[i].b;
}
for (int i = ; i <= n; i++){
int xx = find(i);
if (Ans[num[xx]] == && val[i] == ) printf("%d\n", i);
if (Ans[num[xx]] == && val[i] == ) printf("%d\n", i);
}
printf("end\n");
} int main(){
int T;
#ifdef LOCAL
freopen("data.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
while (scanf("%d%d%d", &q, &p1, &p2)){
if (q == && p1 == && p2 == ) break;
init();
prepare();
dp();
//printf("%d", data[1].b);
}
return ;
}
【POJ1417】【带标记并查集+DP】True Liars的更多相关文章
- poj1417(种类并查集+dp)
题目:http://poj.org/problem?id=1417 题意:输入三个数m, p, q 分别表示接下来的输入行数,天使数目,恶魔数目: 接下来m行输入形如x, y, ch,ch为yes表示 ...
- POJ1417 True Liars —— 并查集 + DP
题目链接:http://poj.org/problem?id=1417 True Liars Time Limit: 1000MS Memory Limit: 10000K Total Submi ...
- poj1417 true liars(并查集 + DP)详解
这个题做了两天了.首先用并查集分类是明白的, 不过判断是否情况唯一刚开始用的是搜索.总是超时. 后来看别人的结题报告, 才恍然大悟判断唯一得用DP. 题目大意: 一共有p1+p2个人,分成两组,一组p ...
- POJ 1417 - True Liars - [带权并查集+DP]
题目链接:http://poj.org/problem?id=1417 Time Limit: 1000MS Memory Limit: 10000K Description After having ...
- POJ 1417 True Liars(种类并查集+dp背包问题)
题目大意: 一共有p1+p2个人,分成两组,一组p1,一组p2.给出N个条件,格式如下: x y yes表示x和y分到同一组,即同是好人或者同是坏人. x y no表示x和y分到不同组,一个为好人,一 ...
- POJ 1417 并查集 dp
After having drifted about in a small boat for a couple of days, Akira Crusoe Maeda was finally cast ...
- [luogu P2170] 选学霸(并查集+dp)
题目传送门:https://www.luogu.org/problem/show?pid=2170 题目描述 老师想从N名学生中选M人当学霸,但有K对人实力相当,如果实力相当的人中,一部分被选上,另一 ...
- 【POJ1733】【带标记并查集】Parity game
Description Now and then you play the following game with your friend. Your friend writes down a seq ...
- 【转】并查集&MST题集
转自:http://blog.csdn.net/shahdza/article/details/7779230 [HDU]1213 How Many Tables 基础并查集★1272 小希的迷宫 基 ...
随机推荐
- Linux学习笔记18——信号1
一 信号的基本概念 信号:是向进程发送的软件通知,通知进程有事件发生. 生成:表示一个信号的产生. 捕获:表示接收到一个信号. 信号的寿命:信号的生成和传递之间的时间间隔. 挂起的信号:已经生成但还未 ...
- 锐浪应用小插曲,asp.net下的使用
下午提前完成了今天的工作内容,整了下bs中的应用,嘿嘿,其中遇到不少问题,接下来说下大概会遇到哪些问题,1:grid++ 6.0插件下载安装之后ie浏览器无法打开,居然什么都没有显示,奇葩啊,系统版本 ...
- poj 2975 Nim(博弈)
Nim Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5232 Accepted: 2444 Description N ...
- TCP协议状态简介
原文出自:Vimer的程序世界 1.建立连接协议(三次握手)(1)客户端发送一个带SYN标志的TCP报文到服务器.这是三次握手过程中的报文1.(2) 服务器端回应客户端的,这是三次握手中的第2个报文, ...
- GraphViz特性笔记(一)
默认纵向,使用“rankdir="LR";”可使视图横向排列: 定义节点可以单独列出,“0;”方便自动生成: “edge[fontname="微软雅黑"];”设 ...
- [置顶] c# asp.net 修改webconfig文件 配置
c# asp.net 修改webconfig文件 配置 #region 修改config文件 /// <summary> /// 修改config文件(AppSetting节点) /// ...
- (一)Eclipse 快捷键
Ctrl+Alt+Down,即可以在下面快速复制一行 Ctrl+Alt+Up,即可以在上面快速复制一行. 1. ctrl+shift+r:打开资源 这可能是所有快捷键组合中最省时间的了.这组快捷键 ...
- JS时钟钟表
<!DOCTYPE html> <html> <head> <meta charset="utf-8" /> ...
- Vim 程序编辑器 经常使用操作
按下 i 进入编辑模式 wq! 强制保存并退出 q! 不保存,强制退出 !有强制的意思 方向键位: k h j l Ctrl + f 向下移动一页 Ctrl + b 向上移动一页 0 一行的开头 ...
- leetcode题解||Reverse Integer 问题
problem: Reverse digits of an integer. Example1: x = 123, return 321 Example2: x = -123, return -321 ...