UESTC Training for Data Structures——L

Problem  L

Problem 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

There are several cases in the input file. The first line of each case 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 for each case 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

/*用并查集，先将所有的元素hash一下，我用的是排序取他们的序号代替
  然后利用r[x]==r[y]^val（r[x]:集合代表到 x 之间奇偶关系）合并和判断是否合法*/

#include<iostream>
#include<cstdio>
#include<cstring>
#define N 10001
using namespace std;
struct data
{
    int st, en;
    char s[10];
} qu[N]; //记录询问
int fa[N],r[N]; //fa[x]: x节点的父亲 r[x]:x到fa[x]的奇偶性
int a[N],b[N]; //用于离散化
int len,n,tot;
int find_father(int x)
{
    if(x==fa[x]) return x;
    else
    {
        int father=find_father(fa[x]);
        r[x]=r[x]^r[fa[x]];
        return fa[x]=father;
    }
}
bool marge_set(int x,int y,int val)
{
    int i=find_father(x);
    int j=find_father(y);
    if(i==j)
    {
        if(r[x]==r[y]^val) return true;
        else return false;
    }
    else
    {
        fa[j]=i;
        r[j]=r[x]^r[y]^val;
        return true;
    }
}
int find(int st,int en,int x)  //二分查找
{
    if(st==en) return st;
    int mid=(st+en)>>1;
    if(b[mid]>=x) return find(st,mid,x);
    else return find(mid+1,en,x);
}
void qsort(int st,int en)
{
    int i=st,j=en,x=a[st];
    while(i<j)
    {
        while(i<j && x<=a[j]) j--;
        if(i<j) { a[i]=a[j]; i++; }
        while(i<j && x>=a[i]) i++;
        if(i<j) { a[j]=a[i]; j--; }
    }
    a[i]=x;
    if(st<i-1) qsort(st,i-1);
    if(i+1<en) qsort(i+1,en);
}
void hash()
{
    tot=0;
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d%s",&qu[i].st,&qu[i].en,qu[i].s);
        a[++tot]=qu[i].st;
        a[++tot]=qu[i].en;
    }
    qsort(1,tot);
    int p1=0,p2=1;
    while(p2<=tot)  //删除重复的值
    {
        b[++p1]=a[p2];
        while(a[p2]==a[p2+1] && p2<=tot) p2++;
        p2++;
    }
    tot=p1;
}
int main()
{
    while(scanf("%d%d",&len,&n)!=EOF)
    {
        hash();
        for(int i=1;i<=10000;i++)
        {
            fa[i]=i;
            r[i]=0;
        }
        int ans=-1;
        int st,en;
        for(int i=1;i<=n;i++)
        {
            int st=qu[i].st,en=qu[i].en;
            if(st>en) { ans=i-1; break; }
            if(en>len) { ans=i-1; break; }
            char s=qu[i].s[0];
            st=find(1,tot,st-1);
            en=find(1,tot,en);
            int p=(s=='o');
            if(!marge_set(st,en,p))
            {
                ans=i-1;
                break;
            }
        }
        if(ans==-1) ans=n;
        printf("%d\n",ans);
    }
    return 0;
}