本地能过但提交过不了是怎么一回事？

#include<cstdio>
#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
using namespace std;
inline int read()
{
	int f=1,x=0;
	char ch=getchar();
	while(ch<'0'||ch>'9')
	{
		if(ch=='-')f=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9')
	{
		x=x*10+ch-'0';
		ch=getchar();
	}
	return x*f;
}
int n,m,a,b,ans,c;
struct node
{
	int l,r,lazy,num;
}tree[800000];
inline int read1()
{
	char c=getchar();
	int x=c-'0';
	return x;
}
void build(int l ,int r,int k)
{
	tree[k].l=l;
	tree[k].r =r;
	if(l==r){
		tree[k].num =read1();
		return;
	}
	int mid=(l+r)/2;
	build(l,mid,k<<1);
	build(mid+1,r,k<<1|1);
	tree[k].num =tree[k<<1].num +tree[k<<1|1].num ;
}
inline void down(int k)
{
	tree[k].lazy=1-tree[k].lazy;
	int a=tree[k].r-tree[k].l+1;
	tree[k].num =a-tree[k].num;
}
void add(int l,int r,int k)
{
	if(l<=tree[k].l &&tree[k].r<=r)
	{
		down(k);
		return;
	}
	if(tree[k].lazy){
		tree[k].lazy=0;
		down(k<<1);
		down(k<<1|1);
	}
	int mid=(tree[k].l +tree[k].r )/2;
	if(mid>=l)add(l,r,k<<1);
	if(mid<r)add(l,r,k<<1|1);
	tree[k].num =tree[k<<1].num +tree[k<<1|1].num;
}
void sear(int l,int r,int k)
{
	if(l<=tree[k].l &&tree[k].r<=r)
	{
		ans+=tree[k].num ;
		return;
	}
	if(tree[k].lazy){
		tree[k].lazy=0;
		down(k<<1);
		down(k<<1|1);
	}
	int mid=(tree[k].l +tree[k].r )/2;
	if(mid>=l)sear(l,r,k<<1);
	if(mid<r)sear(l,r,k<<1|1);
}
int main()
{      
    //freopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    n=read();
    m=read();
    build(1,n,1);
    for(int i=1;i<=m;i++)
    {
    	a=read();
    	b=read();
    	c=read();
    	if(a==0)add(b,c,1);
    	else
    	{
    		ans=0;
    		sear(b,c,1);
    		printf("%d\n",ans);
		}
	}
	return 0;
}