URAL 1003 并查集

有一个01串，给出K次询问，每次回答区间[l,r]中1的个数是奇数还是偶数，找出第一次产生矛盾的地方，如果没有输出K

题解:把端点看成0~x的前缀和sum[x], 就可以得到向量关系sum[r]-sum[l-1]= odd/even, 转化为带权并查集处理

#include <iostream>
#include <cstdio>
#include <cctype>
#include <algorithm>
#include <cstring>
#include <string>
#include <cmath>
#include <vector>
#include <set>
#include <stack>
#include <sstream>
#include <queue>
#include <map>
#include <functional>
#include <bitset>
//#include <unordered_map>
//#include <unordered_set>

using namespace std;
#define pb push_back
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define mk make_pair
#define fi first
#define se second
#define ALL(A) A.begin(), A.end()
#define sc(x) scanf("%d", &x)
#define pr(x) printf(#x":%d\n", x)
#define fastio ios::sync_with_stdio(0), cin.tie(0)
#define frein freopen("in.txt", "r", stdin)
#define freout freopen("out.txt", "w", stdout)
#define freout1 freopen("out1.txt", "w", stdout)
#define debug cout<<"???"<<endl
#define mid ((l+r)>>1)
#define lson ((rt)>>1|1)
#define rson (((rt)>>1)+2)
#define br puts("")

//const ll mod = 1000000007;
const int INF = 0x3f3f3f3f;
const ll mod = 20071027;
//const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-6;
template<class T> T gcd(T a, T b){if(!b)return a;return gcd(b,a%b);}

const int maxn = 1e4+10;
int f[maxn], b[maxn], r[maxn], n, k, cnt;
struct Q{
    int l, r, o;
    Q(int L = 0, int R = 0, int O = 0){
        l = L;
        r = R;
        o = O;
    }
} q[maxn];

void init(){
    for(int i = 0; i < k; i++){
        b[i*2] = q[i].l;
        b[i*2+1] = q[i].r;
    }
    sort(b, b+2*k);
    cnt = unique(b, b+2*k) - b;
    for(int i = 0; i < cnt; i++) f[i] = i, r[i] = 0;
    //for(int i = 0; i < cnt; i++) printf("%d ", b[i]);
    //br;
}

inline int id(int x){
    return lower_bound(b, b+cnt, x) - b;
}

int Find(int x){
    if(x == f[x]) return x;
    int fx = Find(f[x]);
    r[x] ^= r[f[x]];
    return f[x] = fx;
}

int join(int x, int y, int v){
    int fx = Find(x), fy = Find(y);
    //printf("f[%d]:%d, f[%d]:%d, r[%d]:%d, r[%d]:%d, v:%d\n"
    //,x,fx,y,fy,x,r[x],y,r[y],v);
    if(fx == fy)    return r[x]^r[y] == v;
    f[fx] = fy;
    r[fx] = r[x]^v^r[y];
    return 1;
}

int main(){
    //frein;
    //freout;
    while(sc(n) && n != -1){
        sc(k);
        for(int i = 0; i < k; i++){
            char s[10];
            scanf("%d%d%s", &q[i].l, &q[i].r, s);
            q[i].l--;
            q[i].o = (s[0]=='o');
        }
        init();
        int ans = k;
        for(int i = 0; i < k; i++){
            if(join(id(q[i].l), id(q[i].r), q[i].o) == 0){
                ans = i;
                break;
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}