10分求救

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
const int N = 1e5 + 10;
int n , m;
struct tree{
	int l , r , sum , lazy;
}tr[4 * N];
void pushup(int u)
{
	tr[u].sum = tr[u << 1].sum + tr[u << 1 | 1].sum;
}
void pushdown(int u)
{
	if(tr[u].lazy)
	{
		tr[u << 1].lazy += tr[u].lazy % 2;
		tr[u << 1 | 1].lazy += tr[u].lazy % 2;
		tr[u << 1].sum = !tr[u << 1].lazy ? tr[u << 1].sum : tr[u << 1].r - tr[u << 1].l + 1 - tr[u << 1].sum;
		tr[u << 1 | 1].sum = !tr[u << 1 | 1].lazy ? tr[u << 1 | 1].sum : tr[u << 1 | 1].r - tr[u << 1 | 1].l + 1 - tr[u << 1 | 1].sum;	
		tr[u].lazy = 0;
	}
}
void modify(int u,int l,int r)
{
	if(tr[u].l >= l && tr[u].r <= r)
	{
		tr[u].lazy ++;
		tr[u].sum = tr[u].r - tr[u].l + 1 - tr[u].sum;
	}
	else
	{
		pushdown(u);
		int mid = tr[u].l + tr[u].r >> 1;
		if(l <= mid) modify(u << 1 , l , r);
		if(r > mid) modify(u << 1 | 1 , l , r);
		pushup(u);
	}
}
int query(int u,int l,int r)
{
	if(tr[u].l >= l && tr[u].r <= r) return tr[u].sum;
	else{
		pushdown(u);
		int mid = tr[u].l + tr[u].r >> 1;
		int tot = 0;
		if(l <= mid) tot = query(u << 1 , l , r);
		if(r > mid) tot += query(u << 1 | 1 , l , r);
		return tot;
	}
}
void build(int u,int l,int r)
{
	if(l == r){
		tr[u] = { l , r , 0 , 0};
	}
	else{
		tr[u] = { l , r };
		int mid = l + r >> 1;
		build(u << 1 , l , mid);
		build(u << 1 | 1 , mid + 1 , r);
		pushup(u); 
	}
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	cin >> n >> m;
	build(1 , 1 , n);
	while(m--)
	{
		int a, b, c;
		cin >> a >> b >> c;
		if(!a) modify(1 , b , c);
		else cout << query(1 , b  ,c) << endl;
	}
	return 0;
}