#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
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 n, m;
struct tree {
int l, r;
int sum;
int lz;
} tr[MAXN];
int s[MAXN];
inline void push_down(int q) {
tr[q << 1].sum = abs((tr[q].lz % 2) * (tr[q << 1].r - tr[q << 1].l + 1) - tr[q << 1].sum);
tr[q << 1 | 1].sum = abs((tr[q].lz % 2) * (tr[q << 1 | 1].r - tr[q << 1 | 1].l + 1) - tr[q << 1 | 1].sum);
tr[q << 1].lz += tr[q].lz;
tr[q << 1 | 1].lz += tr[q].lz;
tr[q].lz = 0;
}
void build(int q, int l, int r) {
if (l == r)
return void(tr[q] = {l, l, 0, 0});
tr[q] = {l, r, 0, 0};
int mid = l + r >> 1;
build(q << 1, l, mid);
build(q << 1 | 1, mid + 1, r);
}
void update(int q, int l, int r) {
if (tr[q].l >= l && tr[q].r <= r) {
tr[q].sum = tr[q].r - tr[q].l + 1 - tr[q].sum;
tr[q].lz++;
return;
}
push_down(q);
int mid = tr[q].l + tr[q].r >> 1;
if (mid >= l)
update(q << 1, l, r);
if (mid < r)
update(q << 1 | 1, l, r);
tr[q].sum = tr[q << 1].sum + tr[q << 1 | 1].sum;
}
int query(int q, int l, int r) {
if (tr[q].l >= l && tr[q].r <= r) {
return tr[q].sum;
}
push_down(q);
int mid = tr[q].l + tr[q].r >> 1;
int ans = 0;
if (mid >= l)
ans = query(q << 1, l, r);
if (mid < r)
ans += query(q << 1 | 1, l, r);
return ans;
}
int main() {
scanf("%d %d", &n, &m);
int a, b, c;
build(1, 1, n);
while (m--) {
scanf("%d %d %d", &c, &a, &b);
if (c == 0)
update(1, a, b);
else
printf("%d\n", query(1, a, b));
}
return 0;
}
P3870 [TJOI2009] 开关(线段树)
最新推荐文章于 2023-12-16 10:43:46 发布