Wa0pts求调

#include<bits/stdc++.h>
using namespace std;
int n, m, lzy[500005], w[500005];
void pushup(int u) {
	w[u] = w[u * 2] + w[u * 2 + 1];
}
void maketag(int u, int len) {
	w[u] = len - w[u];
	if(lzy[u] == 1) lzy[u] = 0;
	else lzy[0] = 1;
}
void pushdown(int u, int l, int r) {
	int mid = l + r >> 1;
	if(lzy[u] == 0) return ;
	maketag(u * 2, mid - l + 1);
	maketag(u * 2 + 1, r - mid);
	lzy[u] = 0;
}
int InRange(int l, int r, int L, int R) {
	return (l >= L) && (r <= R); 
}
int OutofRange(int l, int r, int L, int R) {
	return (l > R) || (r < L);
}
void update(int u, int l, int r, int L, int R) {
	if(InRange(l, r, L, R)) {
		maketag(u, r - l + 1);
		return ;
	}
	if(OutofRange(l, r, L, R)) return ;
	int mid = l + r >> 1;
	pushdown(u, l, r);
	update(u * 2, l, mid, L, R);
	update(u * 2 + 1, mid + 1, r, L, R);
	pushup(u);
}
int query(int u, int l, int r, int L, int R) {
	if(InRange(l, r, L, R)) {
		return w[u];
	} 
	if(OutofRange(l, r, L, R)) {
		return 0;
	}
	int mid = l + r >> 1;
	pushdown(u, l, r);
	return query(u * 2, l, mid, L, R) + query(u * 2 + 1, mid + 1, r, L, R);
}
signed main() {
	cin >> n >> m;
	while(m --) {
		int op, l, r;
		cin >> op >> l >> r;
		if(op == 0) {
			update(1, 1, n, l, r);
		}
		else {
			cout << query(1, 1, n, l, r) << endl;
		}
	}
}