关于一对一错的灵异事件

#include<bits/stdc++.h>
using namespace std;
int m,n,bl,t;
bool lt[500001],add[800];
int head[800],tail[800];
int sum[800];
int cnt[500001];
int main(){
    cin>>n>>m;
    bl=sqrt(n);
    t=n/bl;
    if(n%bl)t++;
    for(int i=1;i<=t;++i){
        head[i]=(i-1)*bl+1;
        tail[i]=i*bl;
    }
    tail[t]=n;
    for(int i=1;i<=n;++i){
        cnt[i]=(i-1)/bl+1;
    }
    while(m--){
        int a,b,c;
        cin>>a>>b>>c;
        if(a==0)
            if(cnt[b]==cnt[c])
                for(int i=b;i<=c;++i){
                    lt[i]=!lt[i];
                    if(lt[i])sum[cnt[i]]++;
                    else sum[cnt[i]]--;
                }
            else{
                for(int i=cnt[b]+1;i<cnt[c];++i)
                    add[i]=!add[i];
                for(int i=b;i<=tail[cnt[b]];++i){
                    lt[i]=!lt[i];
                    if(lt[i])sum[cnt[i]]++;
                    else sum[cnt[i]]--;
                }
                for(int i=head[cnt[c]];i<=c;++i){
                    lt[i]=!lt[i];
                    if(lt[i])sum[cnt[i]]++;
                    else sum[cnt[i]]--;
                }
            }
        else{
            int ans=0;
            if(cnt[b]==cnt[c])
         	   for(int i=b;i<=c;++i)
                    if(lt[i]^add[cnt[i]])ans++;
       	   	else{
             	for(int i=cnt[b]+1;i<cnt[c];++i)
             		if(add[i])
                        ans+=bl-sum[i];
                    else ans+=sum[i];
             	for(int i=b;i<=tail[cnt[b]];++i)
                    if(lt[i]^add[cnt[i]])ans++;
        		for(int i=head[cnt[c]];i<=c;++i)
                    if(lt[i]^add[cnt[i]])ans++;
   		    }
            cout<<ans<<'\n';
        }
    }
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int n, m, bl, t;
bool lt[500001], add[800];
int head[800], tail[800];
int sum[800];
int cnt[500001];
int main() {
    cin >> n >> m;
    bl = sqrt(n);
    t = n / bl;
    if (n % bl) t++;
    for (int i = 1; i <= t; ++i) {
        head[i] = (i - 1) * bl + 1;
        tail[i] = i * bl;
    }
    tail[t] = n;
    for (int i = 1; i <= n; ++i) {
        cnt[i] = (i - 1) / bl + 1;
    }
    while (m--) {
        int a, b, c;
        cin >> a >> b >> c;
        if (a == 0) {
            if (cnt[b] == cnt[c]) {
                for (int i = b; i <= c; ++i) {
                    lt[i] = !lt[i];
                    if (lt[i]) sum[cnt[i]]++;
                    else sum[cnt[i]]--;
                }
            } else {
                for (int i = cnt[b] + 1; i < cnt[c]; ++i)
                    add[i] = !add[i];
                for (int i = b; i <= tail[cnt[b]]; ++i) {
                    lt[i] = !lt[i];
                    if (lt[i]) sum[cnt[i]]++;
                    else sum[cnt[i]]--;
                }
                for (int i = head[cnt[c]]; i <= c; ++i) {
                    lt[i] = !lt[i];
                    if (lt[i]) sum[cnt[i]]++;
                    else sum[cnt[i]]--;
                }
            }
        } else {
            int res = 0;
            if (cnt[b] == cnt[c]) {
                for (int i = b; i <= c; ++i)
                    if (lt[i] ^ add[cnt[i]]) res++;
            } else {
                for (int i = cnt[b] + 1; i < cnt[c]; ++i)
                    if (add[i])
						res+=bl-sum[i];
					else res += sum[i];
                for (int i = b; i <= tail[cnt[b]]; ++i)
                    if (lt[i] ^ add[cnt[i]]) res++;
                for (int i = head[cnt[c]]; i <= c; ++i)
                    if (lt[i] ^ add[cnt[i]]) res++;
            }
            cout << res << "\n";
        }
    }
    return 0;
}