P5057 [CQOI2006]简单题(树状数组维护差分)

P5057 [CQOI2006]简单题https://www.luogu.com.cn/problem/P5057

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <cmath>
#include <map>
#include <cstdlib>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1000010;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))

int tree[MAXN];
int n;
inline void update(int pos, int x) {
	for (; pos <= n; pos += lowbit(pos)) {
		tree[pos] += x;
	}
}

inline int query(int num) {
	int ans = 0;
	for (; num; num -= lowbit(num)) {
		ans += tree[num];
	}
	return ans;
}


int main() {
	int  m;
	int t, l, r;
	scanf("%d %d", &n, &m);
	while (m--) {
		scanf("%d", &t);
		if (t == 1) {
			scanf("%d %d", &l, &r);
			update(l, 1);
			update(r + 1, 1);
		} else {
			scanf("%d", &l);
			printf("%d\n", query(l) % 2);
		}
	}
	return 0;
}