【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 查看磁盘分区、文件系统、使用情况的命令和相关工具介绍
磁盘分区表.文件系统的查看.统计的工具很多,有些工具是多功能的,不仅仅是查看磁盘的分区表,而且也能进行磁盘分区的操作:但在本文,我们只讲磁盘分区的查看,以及分区的使用情况的查看:本文只是给新手上路之用 ...
- GraphViz特性笔记(一)
默认纵向,使用“rankdir="LR";”可使视图横向排列: 定义节点可以单独列出,“0;”方便自动生成: “edge[fontname="微软雅黑"];”设 ...
- 利用Trie树对字符串集合进行排序并计算特征值
该算法用于将一组乱序的字符串反序列化到一个Trie树中,这个过程即可视为对字符串进行了一次排序. 还可以通过调用 GetFeatureString 将该 Trie 树重新序列化. #include & ...
- 浅谈数据结构-Boyer-Moore算法
上文讲解了KMP算法,这种算法在字符串匹配中应用比较少,在各种文本编辑器中的查找功能大多采用Boyer-Moore算法.1977年,德克萨斯大学的Robert S. Boyer教授和J Strothe ...
- Git服务器仓库的搭建和客户端使用方法
环境说明: 1.fedora21 桌面系统 2.已经配置好yum仓库 一.安装git # yum install git 1.1 创建git用户 创建git账户并登录,直接指定用户目录到/home ...
- 【Android - 框架】之Glide的使用
一.Glide简介: Glide是Google官方推荐的一个图片加载和缓存的开源库,它不仅能实现平滑的图片列表滚动效果,还支持远程图片的获取.大小调整和展示,并且可以加载GIF图片.Glide相比与U ...
- [RxJS] Transformation operator: scan
All of the combination operators take two or more observables as input. These operators may also be ...
- [Reactive Programming] Async requests and responses in RxJS
We will learn how to perform network requests to a backend using RxJS Observables. A example of basi ...
- Instruction (hdu 5083)
Instruction Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Tota ...
- iOS-#ifdef DEBUG代码块介绍
iOS-#ifdef DEBUG宏定义介绍 一.#ifdef DEBUG代码块 #ifdef DEBUG // Debug 模式的代码... #else // Release 模式的代码... #en ...