HDU 3397 Sequence operation

Sequence operation

Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 6272    Accepted Submission(s): 1862

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
  
  

 

Author

lxhgww&&shǎ崽

 

Source

HDOJ Monthly Contest – 2010.05.01

解题思路：极其粗暴的线段树代码题

#include<iostream>
#include<cstdio>
#include<cstring>
#define Max 200005
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
using namespace std;
struct
{
    int cnt;
    int cover;
    int xor;
    int lnum;
    int rnum;
    int lsum1;
    int rsum1;
    int msum1;
    int lsum0;
    int rsum0;
    int msum0;
}tree[Max<<2];
void push_up(int rt,int m)
{
    tree[rt].cnt=tree[rt<<1].cnt+tree[rt<<1|1].cnt;
    tree[rt].lnum=tree[rt<<1].lnum;
    tree[rt].rnum=tree[rt<<1|1].rnum;
    tree[rt].lsum1=tree[rt<<1].lsum1;
    tree[rt].rsum1=tree[rt<<1|1].rsum1;
    if(tree[rt].lsum1==(m-(m>>1))&&tree[rt<<1].rnum==1&&tree[rt<<1|1].lnum==1)
        tree[rt].lsum1+=tree[rt<<1|1].lsum1;
    if(tree[rt].rsum1==(m>>1)&&tree[rt<<1].rnum==1&&tree[rt<<1|1].lnum==1)
        tree[rt].rsum1+=tree[rt<<1].rsum1;
    if(tree[rt<<1].rnum==1&&tree[rt<<1|1].lnum==1)
        tree[rt].msum1=max(max(tree[rt<<1].msum1,tree[rt<<1|1].msum1),tree[rt<<1].rsum1+tree[rt<<1|1].lsum1);
    else
        tree[rt].msum1=max(tree[rt<<1].msum1,tree[rt<<1|1].msum1);
    tree[rt].lsum0=tree[rt<<1].lsum0;
    tree[rt].rsum0=tree[rt<<1|1].rsum0;
    if(tree[rt].lsum0==(m-(m>>1))&&tree[rt<<1].rnum==0&&tree[rt<<1|1].lnum==0)
        tree[rt].lsum0+=tree[rt<<1|1].lsum0;
    if(tree[rt].rsum0==(m>>1)&&tree[rt<<1].rnum==0&&tree[rt<<1|1].lnum==0)
        tree[rt].rsum0+=tree[rt<<1].rsum0;
    if(tree[rt<<1].rnum==0&&tree[rt<<1|1].lnum==0)
        tree[rt].msum0=max(max(tree[rt<<1].msum0,tree[rt<<1|1].msum0),tree[rt<<1].rsum0+tree[rt<<1|1].lsum0);
    else
        tree[rt].msum0=max(tree[rt<<1].msum0,tree[rt<<1|1].msum0);
}
void push_down(int rt,int m)
{
    if(tree[rt].cover!=-1)
    {
        if(tree[rt].cover==0)
        {
            tree[rt<<1].cnt=(m-(m>>1));
            tree[rt<<1|1].cnt=(m>>1);
            tree[rt<<1].cover=tree[rt<<1|1].cover=0;
            tree[rt<<1].lnum=tree[rt<<1|1].lnum=tree[rt<<1|1].rnum=tree[rt<<1].rnum=0;
            tree[rt<<1].lsum1=tree[rt<<1].rsum1=tree[rt<<1].msum1=tree[rt<<1|1].lsum1=tree[rt<<1|1].rsum1=tree[rt<<1|1].msum1=0;
            tree[rt<<1].lsum0=tree[rt<<1].rsum0=tree[rt<<1].msum0=(m-(m>>1));
            tree[rt<<1|1].lsum0=tree[rt<<1|1].rsum0=tree[rt<<1|1].msum0=(m>>1);
        }
        else 
        {
            tree[rt<<1].cnt=tree[rt<<1|1].cnt=0;
            tree[rt<<1].cover=tree[rt<<1|1].cover=1;
            tree[rt<<1].lnum=tree[rt<<1|1].lnum=tree[rt<<1|1].rnum=tree[rt<<1].rnum=1;
            tree[rt<<1].lsum1=tree[rt<<1].rsum1=tree[rt<<1].msum1=(m-(m>>1));
            tree[rt<<1|1].lsum1=tree[rt<<1|1].rsum1=tree[rt<<1|1].msum1=(m>>1);
            tree[rt<<1].lsum0=tree[rt<<1].rsum0=tree[rt<<1].msum0=tree[rt<<1|1].lsum0=tree[rt<<1|1].rsum0=tree[rt<<1|1].msum0=0;
        }
        tree[rt].cover=-1;
        tree[rt<<1].xor=tree[rt<<1|1].xor=0;
    }
    if(tree[rt].xor)
    {
            tree[rt].xor=0;
            tree[rt<<1].xor^=1;
            tree[rt<<1|1].xor^=1;
            tree[rt<<1].cnt=(m-(m>>1))-tree[rt<<1].cnt;
            tree[rt<<1|1].cnt=(m>>1)-tree[rt<<1|1].cnt;
            if(tree[rt<<1].lnum)
                tree[rt<<1].lnum=0;
            else
                tree[rt<<1].lnum=1;
            if(tree[rt<<1].rnum)
                tree[rt<<1].rnum=0;
            else
                tree[rt<<1].rnum=1;
            if(tree[rt<<1|1].lnum)
                tree[rt<<1|1].lnum=0;
            else
                tree[rt<<1|1].lnum=1;
            if(tree[rt<<1|1].rnum)
                tree[rt<<1|1].rnum=0;
            else
                tree[rt<<1|1].rnum=1;
            swap(tree[rt<<1].lsum0,tree[rt<<1].lsum1);
            swap(tree[rt<<1].rsum0,tree[rt<<1].rsum1);
            swap(tree[rt<<1].msum0,tree[rt<<1].msum1);
            swap(tree[rt<<1|1].lsum0,tree[rt<<1|1].lsum1);
            swap(tree[rt<<1|1].rsum0,tree[rt<<1|1].rsum1);
            swap(tree[rt<<1|1].msum0,tree[rt<<1|1].msum1);
    }
}
void build(int l,int r,int rt)
{
    tree[rt].cover=-1;
    tree[rt].xor=0;
    if(l==r)
    {
        scanf("%d",&tree[rt].lnum);
        tree[rt].rnum=tree[rt].lnum;
        if(tree[rt].lnum)
        {
            tree[rt].cnt=0;
            tree[rt].lsum1=tree[rt].rsum1=tree[rt].msum1=1;
            tree[rt].lsum0=tree[rt].rsum0=tree[rt].msum0=0;
        }
        else
        {
            tree[rt].cnt=1;
            tree[rt].lsum1=tree[rt].rsum1=tree[rt].msum1=0;
            tree[rt].lsum0=tree[rt].rsum0=tree[rt].msum0=1;
        }
        return ;
    }
    int m=(l+r)>>1;
    build(lson);
    build(rson);
    push_up(rt,r-l+1);
}
void update(int L,int R,int c,int l,int r,int rt)
{
    if(l!=r)
        push_down(rt,r-l+1);
    if(L<=l&&r<=R)
    {
        if(c==1)
        {
            tree[rt].cover=c;
            tree[rt].lnum=tree[rt].rnum=c;
            tree[rt].cnt=0;
            tree[rt].lsum1=tree[rt].rsum1=tree[rt].msum1=r-l+1;
            tree[rt].lsum0=tree[rt].rsum0=tree[rt].msum0=0;
        }
        else if(c==0)
        {
            tree[rt].cover=c;
            tree[rt].lnum=tree[rt].rnum=c;
            tree[rt].cnt=r-l+1;
            tree[rt].lsum1=tree[rt].rsum1=tree[rt].msum1=0;
            tree[rt].lsum0=tree[rt].rsum0=tree[rt].msum0=r-l+1;
        }
        else
        {
            tree[rt].xor=1;
            if(tree[rt].lnum)
                tree[rt].lnum=0;
            else
                tree[rt].lnum=1;
            if(tree[rt].rnum)
                tree[rt].rnum=0;
            else
                tree[rt].rnum=1;
            tree[rt].cnt=r-l+1-tree[rt].cnt;
            swap(tree[rt].lsum0,tree[rt].lsum1);
            swap(tree[rt].rsum0,tree[rt].rsum1);
            swap(tree[rt].msum0,tree[rt].msum1);
        }
        return ;
    }
    int m=(l+r)>>1;
    if(L<=m)
        update(L,R,c,lson);
    if(R>m)
        update(L,R,c,rson);
    push_up(rt,r-l+1);
}
int query1(int L,int R,int l,int r,int rt)
{
    int ans=0;
    if(l!=r)
        push_down(rt,r-l+1);
    if(L<=l&&R>=r)
    {
        ans=r-l+1-tree[rt].cnt;
        return ans;
    }
    int m=(l+r)>>1;
    if(L<=m)
        ans+=query1(L,R,lson);
    if(R>m)
        ans+=query1(L,R,rson);
    return ans;
}
int query2(int L,int R,int l,int r,int rt)
{
    int ans=0;
    if(l!=r)
        push_down(rt,r-l+1);
    if(L<=l&&R>=r)
    {
        ans=tree[rt].msum1;
        return ans;
    }
    int m=(l+r)>>1;
    if(L<=m)
        ans=max(ans,query2(L,R,lson));
    if(R>m)
        ans=max(ans,query2(L,R,rson));
    if(tree[rt<<1].rnum==1&&tree[rt<<1|1].lnum==1&&L<=m&&R>=m+1)
    {
        int t=min(m+tree[rt<<1|1].lsum1,R)-max(m-tree[rt<<1].rsum1+1,L)+1;
        ans=max(ans,t);
    }
    return ans;
}
int main()
{
    int t,m,n,q,a,b;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        build(1,n,1);
        while(m--)
        {
            scanf("%d%d%d",&q,&a,&b);
            a++;b++;
            switch(q)
            {
            case 0:
                update(a,b,q,1,n,1);
                break;
            case 1:
                update(a,b,q,1,n,1);
                break;
            case 2:
                update(a,b,q,1,n,1);
                break;
            case 3:
                printf("%d\n",query1(a,b,1,n,1));
                break;
            case 4:
                printf("%d\n",query2(a,b,1,n,1));
                break;
            }
        }
    }
    return 0;
}