离散化 + 区间上的种类并查集
人为的把区间分为两类,0类(偶数个1),1类(偶数个0)。
假若有两个区间[a,b],[c,d]。其中c = b + 1,换句话说两个闭区间相邻,当[c,d]为1类时,则[a,b]一定和[a,d]不同类,(不妨假设[a,b]为0类,因为[c,d]为1类,所以[a,d]为1类,偶加奇为奇,不妨假设[a,b]为1类,因为[c,d]为1类,所以[a,d]为0类,奇加奇为偶)。然后用右端点代表当前区间,左端-1代表前一个相邻区间(左相邻),然后右端点合并到,左端点-1,以[a,b]为例,把b合并到a-1,把当[a,b]为0类,把rank[b] = 0,否则rank[b] = 1。想想看这里的合并是有含义的每棵树的根结点a到任意一个结点b,代表着这样一个区间(a,b]。
代码:
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdlib>
#include <math.h>
using namespace std;
const int MAXN = 100005;
int pre[MAXN];
int ranks[MAXN];
int a[MAXN];
int cnt = 0;
struct Q
{
int x;
int y;
char s[10];
}q[MAXN];
int binary(int r)
{
int x = 0,y = cnt;
int m = x + (y-x)/2;
while(r != a[m]){
if(a[m]>r)y = m;
else x = m+1;
m = x + (y-x)/2;
}
return m;
}
int find_DS(int r)
{
if(r == pre[r])return r;
int fa = pre[r];
pre[r] = find_DS(pre[r]);
ranks[r] = (ranks[r] + ranks[fa])%2;
return pre[r];
}
bool merge_DS(int a,int b,int c)
{
int fx = find_DS(a),fy = find_DS(b);
if(fx == fy) if((ranks[b]-ranks[a]+2)%2 == c)return 1;
else return 0;
pre[fy] = fx;
ranks[fy] = (ranks[a] - ranks[b] + c)%2;
return 1;
}
int main()
{
//freopen("in.txt","r",stdin);
int n,m,a1,b1,c,num;
scanf("%d%d",&n,&m);
for(int i = 0;i<m;i++){
scanf("%d%d%s",&q[i].x,&q[i].y,q[i].s);
q[i].x--;
a[cnt++] = q[i].x;a[cnt++] = q[i].y;
}
sort(a,a+cnt);
cnt = unique(a,a+cnt) - a;
for(int i = 0;i<cnt;i++){
pre[i] = i;
ranks[i] = 0;
}
num = 0;
for(int i = 0;i<m;i++){
a1 = binary(q[i].x),b1 = binary(q[i].y);
if(q[i].s[0] == 'e')c = 0;
else c = 1;
if(!merge_DS(a1,b1,c))break;
num++;
}
printf("%d\n",num);
return 0;
}