hdu3397

hdu3397 Sequence operation

Time Limit: 10000/5000 MS

 (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4475    Accepted Submission(s): 1297

 

Problem Description

lxhgww got a sequence contains n characters which are all '0's or '1's.We have five operations here:Change operations:0 a b  change all characters into '0's in [a , b]1 a b  change all characters into '1's in [a , b]2 a b  change all '0's into '1's and change all '1's into '0's in [a, b]Output operations:3 a b  output the number of '1's in [a, b]4 a b  output the length of the longest continuous '1' string in [a , b]

 

Input

T(T<=10) in the first line is the case number.Each case has two integers in the first line: n and m (1 <= n , m <= 100000).The next line contains n characters, '0' or '1' separated by spaces.Then m lines are the operations:op a b: 0 <= op <= 4 , 0 <= a <= b < n.

Output

For each output operation , output the result.

 

Sample Input

 
 

  
  1
10 10
0 0 0 1 1 0 1 0 1 1
1 0 2
3 0 5
2 2 2
4 0 4
0 3 6
2 3 7
4 2 8
1 0 5
0 5 6
3 3 9
 
 

 

Sample Output

  
  

   
   5
2
6
5
  
  

#include<cstdio>
#include<cstring>
using namespace std;
#define N 100100
int cover[4*N];
int sum[4*N];
int lm[4*N],rm[4*N],maxi[4*N];
int Lm[4*N],Rm[4*N],Maxi[4*N];
inline void swap(int &a,int &b)
{
    int mid=a;a=b;b=mid;
}
inline int max(int a,int b)
{
    return a>b?a:b;
}
inline int min(int a,int b)
{
    return a<b?a:b;
}
void makexor(int k,int l)
{
    if(cover[k]!=-1)cover[k]^=1;
    swap(lm[k],Lm[k]);
    swap(rm[k],Rm[k]);
    swap(Maxi[k],maxi[k]);
    sum[k]=(l-sum[k]);
}
void push_down(int k,int l)
{
    if(l==1)return ;
    if(cover[k]!=-1)
    {
        cover[2*k]=cover[2*k+1]=cover[k];
        sum[2*k]=maxi[2*k]=lm[2*k]=rm[2*k]=!cover[k]?0:(l-l/2);
        Maxi[2*k]=Lm[2*k]=Rm[2*k]=cover[k]?0:(l-l/2);
        sum[2*k+1]=maxi[2*k+1]=lm[2*k+1]=rm[2*k+1]=!cover[k]?0:(l/2);
        Maxi[2*k+1]=Lm[2*k+1]=Rm[2*k+1]=cover[k]?0:(l/2);
        cover[k]=-1;
    }
}
void push_up(int k,int l)
{
    sum[k]=sum[2*k]+sum[2*k+1];
    lm[k]=(lm[2*k]==(l-l/2))?(lm[2*k]+lm[2*k+1]):lm[2*k];
    rm[k]=(rm[2*k+1]==l/2)?(l/2+rm[2*k]):rm[2*k+1];
    maxi[k]=max(rm[2*k]+lm[2*k+1],max(maxi[2*k],maxi[2*k+1]));
    Lm[k]=(Lm[2*k]==(l-l/2))?(Lm[2*k]+Lm[2*k+1]):Lm[2*k];
    Rm[k]=(Rm[2*k+1]==l/2)?(l/2+Rm[2*k]):Rm[2*k+1];
    Maxi[k]=max(Rm[2*k]+Lm[2*k+1],max(Maxi[2*k],Maxi[2*k+1]));
}
void build(int left,int right,int k)
{
    cover[k]=-1;
    if(left==right)
    {
        scanf("%d",&sum[k]);
        maxi[k]=lm[k]=rm[k]=sum[k];
        Maxi[k]=Lm[k]=Rm[k]=sum[k]?0:1;
        return ;
    }
    int mid=(left+right)>>1;
    build(left,mid,2*k);
    build(mid+1,right,2*k+1);
    push_up(k,right-left+1);
}
void insert(int left,int right,int k,int l,int r,int c)
{

    if(l<=left&&right<=r)
    {
        sum[k]=maxi[k]=lm[k]=rm[k]=!c?0:(right-left+1);
        Maxi[k]=Lm[k]=Rm[k]=c?0:(right-left+1);
        cover[k]=c;
        return ;
    }
    push_down(k,right-left+1);
    int mid=(left+right)>>1;
    if(l<=mid)insert(left,mid,2*k,l,r,c);
    if(r>mid)insert(mid+1,right,2*k+1,l,r,c);
    push_up(k,right-left+1);
}
void XOR(int left,int right,int k,int l,int r)
{
    if(l<=left&&right<=r&&cover[k]!=-1||left==right)
    {
        makexor(k,right-left+1);return ;
    }
    push_down(k,right-left+1);
    int mid=(left+right)>>1;
    if(l<=mid)XOR(left,mid,2*k,l,r);
    if(r>mid)XOR(mid+1,right,2*k+1,l,r);
    push_up(k,right-left+1);
}
int queue(int left,int right,int k,int l,int r)
{
    if(l<=left&&right<=r)
    {
        return maxi[k];
    }
    push_down(k,right-left+1);
    int mid=(left+right)>>1;
    if(r<=mid)return queue(left,mid,2*k,l,r);
    if(l>mid)return queue(mid+1,right,2*k+1,l,r);
    int ans1=queue(left,mid,2*k,l,mid);
    int ans2=queue(mid+1,right,2*k+1,mid+1,r);
    int temp=min(mid-l+1,rm[2*k])+min(r-mid,lm[2*k+1]);
    return max(temp,max(ans1,ans2));
}
int queue_sum(int left,int right,int k,int l,int r)
{
    if(l<=left&&right<=r)
    {
        return sum[k];
    }
    push_down(k,right-left+1);
    int mid=(left+right)>>1,ans=0;
    if(l<=mid)ans=queue_sum(left,mid,2*k,l,r);
    if(r>mid)ans+=queue_sum(mid+1,right,2*k+1,l,r);
    return ans;
}
int main()
{
    //freopen("C:\\Users\\Administrator\\Desktop\\in.txt","r",stdin);
    int n,m,c,a,b,T;
    while(~scanf("%d",&T))
    {
        while(T--)
        {
            scanf("%d%d",&n,&m);
            build(1,n,1);
            while(m--)
            {
                scanf("%d%d%d",&c,&a,&b);
                ++a,++b;
                if(c<2&&c>=0)insert(1,n,1,a,b,c);
                if(c==2)XOR(1,n,1,a,b);
                else if(c==4) printf("%d\n",queue(1,n,1,a,b));
                else if(c==3)printf("%d\n",queue_sum(1,n,1,a,b));
            }
        }
    }
    return 0;
}