lougu2846

區間01修改區間求和模板

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define lson rt<<1
#define rson rt<<1|1
const int N = 1e5 + 7;
int a[N];
struct node
{
	ll l, r;
	ll val, lazy;
}tree[N*4];
int n, m;
void push_up(int rt)
{
	tree[rt].val = tree[lson].val + tree[rson].val;
}
void add(int rt)
{
	if (tree[rt].lazy)tree[rt].lazy = 0;
	else tree[rt].lazy = 1;
	tree[rt].val = tree[rt].r - tree[rt].l + 1 - tree[rt].val;
	return;
}
void push_down(int rt)
{
	if (tree[rt].lazy)
	{
		tree[lson].lazy += tree[rt].lazy;
		tree[rson].lazy += tree[rt].lazy;
		for (int i = 1; i <= tree[rt].lazy % 2; i++)
		{
			tree[lson].val = tree[lson].r - tree[lson].l + 1 - tree[lson].val;
			tree[rson].val = tree[rson].r - tree[rson].l + 1 - tree[rson].val;
		}
		tree[rt].lazy = 0;
	}
}
void build(int rt, int l, int r)
{
	tree[rt].l = l, tree[rt].r = r;
	tree[rt].lazy = 0;
	if (l == r)
	{
		tree[rt].val = a[l];
		return;
	}
	else
	{
		int mid = l + r >> 1;
		build(lson, l, mid);
		build(rson, mid + 1, r);
		push_up(rt);
	}
}
void update_interval(int rt, int l, int r)
{
	if (l <= tree[rt].l && r >= tree[rt].r)
	{
		tree[rt].val = tree[rt].r - tree[rt].l + 1 - tree[rt].val;
		tree[rt].lazy++;
		return;
	}
	push_down(rt);
	int mid = tree[rt].l + tree[rt].r >> 1;
	if (l <= mid)update_interval(lson, l, r);
	if (r > mid)update_interval(rson, l, r);
	push_up(rt);
}
ll query_interval(int rt, int l, int r)
{
	ll res = 0;
	if (l <= tree[rt].l && r >= tree[rt].r)
		return tree[rt].val;
	push_down(rt);
	int mid = tree[rt].l + tree[rt].r >> 1;
	if (l <= mid)res += query_interval(lson, l, r);
	if (r > mid)res += query_interval(rson, l, r);
	return res;
}
int main()
{
	while (cin >> n >> m)
	{
		build(1, 1, n);
		while (m--)
		{
			int a, b, c;
			cin >> a >> b >> c;
			if (a == 0)
			{
				update_interval(1, b, c);
			}
			else
			{
				cout << query_interval(1, b, c) << endl;
			}
		}
	}
}