【POJ1733】【Parity game】【map离散化】【加权并查集模板】
来源:互联网 发布:看盘软件哪个最好 编辑:程序博客网 时间:2024/05/07 05:21
Parity game
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7127 Accepted: 2763
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.
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
1051 2 even3 4 odd5 6 even1 6 even7 10 odd
Sample Output
3
Source
CEOI 1999
[Submit] [Go Back] [Status] [Discuss]
Home Page Go Back To top
#include <iostream>#include <cstring>#include <cmath>#include <queue>#include <stack>#include <list>#include <map>#include <set>#include <string>#include <cstdlib>#include <cstdio>#include <algorithm>using namespace std; #define rep(i,a,n) for (int i=a;i<n;i++)#define per(i,a,n) for (int i=n-1;i>=a;i--)const int maxn = 10010;int F[maxn];int val[maxn];map<int,int> mp;int tot;int insert(int x){if(mp.find(x) == mp.end()) mp[x] = tot++;return mp[x];}int find(int x){if(F[x] == -1) return x;int t = find(F[x]);val[x] ^= val[F[x]];return F[x] = t;}int main(){ int n,m;int u,v;char str[20];while(scanf("%d%d",&n,&m) == 2){tot = 0;memset(F,-1,sizeof(F));memset(val,0,sizeof(val));mp.clear();int ans = m;for(int i=0;i<m;i++){scanf("%d%d%s",&u,&v,&str);if(u > v) swap(u,v);if(ans < m) continue;u = insert(u-1);v = insert(v);int tmp;if(str[0] == 'e') tmp = 0; else tmp = 1; int t1 = find(u); int t2 = find(v); if(t1 == t2) { if(val[u] ^ val[v] != tmp) ans = i; } else { F[t2] = t1; val[t2] = tmp^val[u]^val[v]; }}printf("%d\n",ans);} return 0;}
0 0
- 【POJ1733】【Parity game】【map离散化】【加权并查集模板】
- poj1733 Parity game(并查集+离散化--经典)
- POJ1733 Parity game(并查集模型+带权并查集+离散化)
- POJ1733 - Parity game - 并查集
- poj1733 Parity game(并查集)
- POJ1733 parity game(并查集)
- poj1733 & Ural 1003 Parity Game (hash+并查集 )
- kuangbin专题五 并查集 POJ1733 Parity game
- poj1733 并查集+离散化
- POJ Parity game 离散化+并查集
- poj 1733 - Parity game(离散化+并查集)
- poj 1733 Parity game 并查集 离散化
- pku1733 Parity game(离散化+并查集)
- poj 1733 Parity game 【种类并查集+离散化】
- Poj 1733 Parity Game(离散化+并查集)
- CEOI 1999 Parity game (并查集+离散化)
- poj 1733Parity game(map离散+带权并查集)
- 【tyvj1252/poj1733】小胖的奇偶/Parity game 并查集
- Android 模式 持续更新
- php array_push()函数在clone()中的应用
- POJ 3468 A Simple Problem with Integers
- MySQL架构方案
- windows内核编程基础篇之字符串的初始化
- 【POJ1733】【Parity game】【map离散化】【加权并查集模板】
- linux服务器必要的两个系统设置
- 欢迎使用CSDN-markdown编辑器
- 虚拟内存管理的作用/好处
- Mysql 主从复制
- 如何在window下操作和连接sqlite 的db文件
- 算法竞赛入门经典第三章
- Geohash的原理、算法和具体应用探究(优秀)
- Error:无法打开 源文件 “stdafx.h”