# H - Parity game

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.

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
10
5
1 2 even
3 4 odd
5 6 even
1 6 even
7 10 odd

Sample Output
3

``````#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 1e5 + 10;
int n, m, cnt = 0;
int ans;
int a[maxn];
int p[maxn];
int d[maxn];
char s;
struct node{
int l, r, v;
}t[maxn];

void init(){
scanf("%d%d",&n,&m);
for(int i = 1; i <= m; i ++){
scanf("%d%d%s",&t[i].l,&t[i].r,s);
t[i].v = (s == 'e' ? 0 : 1);
a[++ cnt] = t[i].l - 1;
a[++ cnt] = t[i].r;
}
sort(a + 1, a + cnt + 1);
n = unique(a + 1, a + cnt + 1) - (a + 1);

for(int i = 1; i <= n; i ++)  p[i] = i;
}

int find(int x){
if(x != p[x]){
int t = find(p[x]);
d[x] ^= d[p[x]];
p[x] = t;
}
return p[x];
}

int main()
{
init();

for(int i = 1; i <= m; i ++){
int x = lower_bound(a + 1, a + n + 1, t[i].l - 1) - a;
int y = lower_bound(a + 1, a + n + 1, t[i].r) - a;
int px = find(x);
int py = find(y);
if(px == py){
if(d[x] ^ d[y] != t[i].v){
printf("%d\n", i - 1);
return 0;
}
}
else{
p[px] = py;
d[px] = d[y] ^ d[x] ^ t[i].v;
}
}
printf("%d\n", m);
return 0;
}

``````