AcWing 1268. 简单题
原题链接
中等
作者:
南来北往
,
2022-11-25 15:11:43
,
所有人可见
,
阅读 118
C++ 代码
#include<bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int tr[N];
int n, m;
int lowbit(int x) {
return x & (-x);
}
void add(int a, int c) {
for (; a <= n; a += lowbit(a))
tr[a] += c;
}
int sum(int a) {
int res=0;
for (; a; a -= lowbit(a)) res += (tr[a]%2+2)%2;
return (res%2+2)%2;
}
int main() {
cin >> n >> m;
while (m--) {
int q;
cin >> q;
if (q == 1) {
int a, b;
cin >> a >> b;
add(a,1);
add(b + 1, -1);
}
else {
int a;
cin >> a;
cout << sum(a) << endl;
}
}
}