1733 Parity game

原创 2007年10月15日 08:40:00
Parity game
Time Limit: 1000MS   Memory Limit: 65536K
Total Submissions: 900   Accepted: 357

Description
Now and then you play the following game with your friend. Your friend writes down a sequence consisting of zeroes and ones. You choose a continuous subsequence (for example the subsequence from the third to the fifth digit inclusively) and ask him, whether this subsequence contains even or odd number of ones. Your friend answers your question and you can ask him about another subsequence and so on. Your task is to guess the entire sequence of numbers.

You suspect some of your friend's answers may not be correct and you want to convict him of falsehood. Thus you have decided to write a program to help you in this matter. The program will receive a series of your questions together with the answers you have received from your friend. The aim of this program is to find the first answer which is provably wrong, i.e. that there exists a sequence satisfying answers to all the previous questions, but no such sequence satisfies this answer.

Input
The first line of input contains one number, which is the length of the sequence of zeroes and ones. This length is less or equal to 1000000000. In the second line, there is one positive integer which is the number of questions asked and answers to them. The number of questions and answers is less or equal to 5000. The remaining lines specify questions and answers. Each line contains one question and the answer to this question: two integers (the position of the first and last digit in the chosen subsequence) and one word which is either `even' or `odd' (the answer, i.e. the parity of the number of ones in the chosen subsequence, where `even' means an even number of ones and `odd' means an odd number).

Output
There is only one line in output containing one integer X. Number X says that there exists a sequence of zeroes and ones satisfying first X parity conditions, but there exists none satisfying X+1 conditions. If there exists a sequence of zeroes and ones satisfying all the given conditions, then number X should be the number of all the questions asked.

Sample Input

 

Sample Output

 

Source
CEOI 1999

 ************************************************************************************

******************************************************************************************

Source Code
//pku1733 Parity game
//by oyjpArt
/*
Step 1:   由于端点数目远远小于数据范围 给于数据范围离散化
Step 2:将区间问题转化成单点 sum[a,b] = sum[0,b] - sum[0, a-1];
Step 3:   构造并查集,设置一个属性prt代表和父结点的XOR值。即:
如果父结点为偶 prt = true 则本节点为奇
同理可推知其他情况 构建并查集的目的是为了是查询能够在有联系的两个节点之间通过其他结点迅速判断奇偶性
对于一个询问(l, r, p):若l-1与r是属于同一个集合,则检查l-1与r相对于根o的奇偶性差异P[l -1, o]与P[r, o]。看这两个差异值的差异是不是就是p,即P[l-1, o] xor P[r, o]是不是等于p,不是则矛盾。若l-1与r是不属于同一个集合,则将l-1与r所在树的根节点合并起来,这两个根结点间奇偶性差异为P[l-1,o] xor P[r, o] xor p。
有构建的方式可以看出 这个并查集是可以路径压缩的
  */
#include <map>
#include <iostream>
#include <string>
using namespace std;
const int N  = 5010;
int x[N], y[N];
bool odd[N];
int p[2 * N];
bool prt[2 * N];
int Root(int x, bool & e)
{
int r = x, t = x;
bool res = prt[x];
while(p[r] != r)
{
r = p[r];
res = res ^ prt[r];
}
e = res;
return r;
}
void Union(int a, int b, bool e)
{
p[a] = b;
prt[a] = e;
}
bool chk(int idx)
{
int a = x[idx], b = y[idx];
bool e = odd[idx], ea, eb;
int ra = Root(a, ea), rb = Root(b, eb);
if(ra == rb)
{
if( (ea ^ eb) != e) return false;
}
else
{
Union(ra, rb, (ea ^ eb ^ e) );
}
return true;
}
int main()
{
//    freopen("t.in", "r", stdin);
map<int, int> m;
int l, i, ncmd, a, b, idx;
string s;
cin >> l >> ncmd;
for(i = 0, idx = 0; i < ncmd; ++i)
{
cin >> a >> b >> s;
if(a > b) swap(a, b);
--a;
if(a < 0)
while(1) printf("1");
if(!m.count(a)) m[a] = idx++;
if(!m.count(b)) m[b] = idx++;
x[i] = m[a]; y[i] = m[b];
odd[i] = s[0] == 'o';
}
for(i = 0; i < idx; ++i) { p[i] = i; prt[i] = false; }
for(i = 0; i < ncmd; ++i) {
if(!chk(i))
break;
}
printf("%d/n", i);
return 0;
}
3
10
5
1 2 even
3 4 odd
5 6 even
1 6 even
7 10 odd

一步一步学区块链(3)客户端使用

通过学习本篇,你可以在脑海中建立区块链大致的“模样”,加深理解。本文中所有的相关演示都是基于以太坊技术在 OS X系统环境下进行操作。 文章分两部分:一、安装geth客户端,通过命令行进行相关操作  ...
  • jwter87
  • jwter87
  • 2016年11月28日 10:47
  • 2309

【tyvj1252/poj1733】小胖的奇偶/Parity game 并查集

DescriptionNow and then you play the following game with your friend. Your friend writes down a sequ...
  • LOI_DQS
  • LOI_DQS
  • 2015年10月13日 20:27
  • 1223

关于 android 的JNI的java 调用 C和 C 调用JAVA(1)

以前研究过 android的JNI调用!!后面
  • lb5761311
  • lb5761311
  • 2014年09月19日 14:44
  • 2798

poj 1733 Parity game 【种类并查集+离散化】

Parity game Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 6767   Ac...
  • letterwuyu
  • letterwuyu
  • 2015年04月22日 00:07
  • 406

POJ1733 Parity game(并查集模型+带权并查集+离散化)

题意:有一个长度已知的01串,给出[l,r]这个区间中的1是奇数个还是偶数个,给出一系列语句问前几个是正确的 思路:一类经典的并查集题目,经典模型就是将[l,r]这个区间化为(l-1,r]...
  • Rain722
  • Rain722
  • 2017年07月19日 20:56
  • 78

POJ - 1733 Parity game 种类并查集+离散化

思路:d(i, j)表示区间(i, j]的1的个数的奇偶性。输入最多共有5000*2个点,需要离散化处理一下。剩下的就是并查集判冲突。 AC代码 #include #include #incl...
  • flyawayl
  • flyawayl
  • 2017年04月03日 15:23
  • 547

POJ 1733 Parity game(哈希|离散+带权并查集)

Parity game Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 9402 Accepted: 364...
  • u013306830
  • u013306830
  • 2017年08月09日 12:59
  • 89

POJ 1733 parity game (hash离散+并查集)

#include using namespace std; #define N 5005 /* hash+离散化===========================================...
  • u014309268
  • u014309268
  • 2014年03月24日 04:03
  • 508

POJ 1733 Parity game

黑书上的题,刚开始看不会,找结题报告,网上一大堆用什么异或思想,完全把问题复杂化,纠结了一下午加一个晚上,最后终于找到一种好理解的思想, 如果i, j 间的1个数为偶数, 那么1 ~ i - 1, ...
  • whu_zxl
  • whu_zxl
  • 2012年08月09日 20:34
  • 291

POJ1733 - Parity game - 并查集

带权并查集一道不错的题,要用到离散化
  • wsxsd94
  • wsxsd94
  • 2014年08月15日 14:47
  • 431
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1733 Parity game
举报原因:
原因补充:

(最多只允许输入30个字)