大佬求条，MLE+RE

#include<bits/stdc++.h>
using namespace std;

const int N=8e6+10;
struct node{
	int sum;
	int lz;
}tree[N];
int n,m,s,e,op;

inline void push_down(int i,int l,int r){
	if(tree[i].lz){
		int mid=(l+r)>>1;
		tree[i<<1].lz^=1;
		tree[i<<1|1].lz^=1;
		tree[i<<1].sum=mid-l+1-tree[i<<1].sum;
		tree[i<<1|1].sum=r-mid-tree[i<<1|1].sum;
		tree[i].lz=0;
	}
}

inline int push_up(int i){
	tree[i].sum=tree[i<<1].sum+tree[i<<1|1].sum;
}

inline void change(int i,int l,int r,int kl,int kr){
	if(l>=kl&&r<=kr){
		tree[i].lz^=1;
		tree[i].sum=r-l+1-tree[i].sum;
		return;
	}
	push_down(i,l,r);
	int mid=(l+r)>>1;
	if(mid>=kl) change(i*2,l,mid,kl,kr);
	if(mid+1<=kr) change(i*2+1,mid+1,r,kl,kr);
	push_up(i);
}

inline long long search(int i,int l,int r,int kl,int kr){
	if(l>=kl&&r<=kr) return tree[i].sum;
	push_down(i,l,r);
	int mid=(l+r)>>1;
	long long ans=0;
	if(mid>=kl) ans+=search(i*2,l,mid,kl,kr);
	if(mid+1<=kr) ans+=search(i*2+1,mid+1,r,kl,kr);
	return ans;
}

int main(){
	cin>>n>>m;
	for(int i=1;i<=m;i++){
		cin>>op>>s>>e;
		if(op==0) change(1,1,n,s,e);
		else cout<<search(1,1,n,s,e)<<endl;
	}	
}