HDU 4046 Panda （ACM ICPC 2011北京赛区网络赛）

HDU 4046 Panda （ACM ICPC 2011北京赛区网络赛）

Panda

Time Limit: 10000/4000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 1816    Accepted Submission(s): 632

Problem Description

When I wrote down this letter, you may have been on the airplane to U.S. 

We have known for 15 years, which has exceeded one-fifth of my whole life. I still remember the first time we went to the movies, the first time we went for a walk together. I still remember the smiling face you wore when you were dressing in front of the mirror. I love your smile and your shining eyes. When you are with me, every second is wonderful.

The more expectation I had, the more disappointment I got. You said you would like to go to U.S.I know what you really meant. I respect your decision. Gravitation is not responsible for people falling in love. I will always be your best friend. I know the way is difficult. Every minute thinking of giving up, thinking of the reason why you have held on for so long, just keep going on. Whenever you’re having a bad day, remember this: I LOVE YOU.

I will keep waiting, until you come back. Look into my eyes and you will see what you mean to me.

There are two most fortunate stories in my life: one is finally the time I love you exhausted. the other is that long time ago on a particular day I met you.

Saerdna.

It comes back to several years ago. I still remember your immature face.

The yellowed picture under the table might evoke the countless memory. The boy will keep the last appointment with the girl, miss the heavy rain in those years, miss the love in those years. Having tried to conquer the world, only to find that in the end, you are the world. I want to tell you I didn’t forget. Starry night, I will hold you tightly.

Saerdna loves Panda so much, and also you know that Panda has two colors, black and white.

Saerdna wants to share his love with Panda, so he writes a love letter by just black and white.

The love letter is too long and Panda has not that much time to see the whole letter.

But it's easy to read the letter, because Saerdna hides his love in the letter by using the three continuous key words that are white, black and white.

But Panda doesn't know how many Saerdna's love there are in the letter.

Can you help Panda?

 

Input

An integer T means the number of test cases T<=100

For each test case:

First line is two integers n, m

n means the length of the letter, m means the query of the Panda. n<=50000,m<=10000

The next line has n characters 'b' or 'w', 'b' means black, 'w' means white.

The next m lines 

Each line has two type

Type 0: answer how many love between L and R. (0<=L<=R<n)

Type 1: change the kth character to ch(0<=k<n and ch is ‘b’ or ‘w’)

 

Output

For each test case, output the case number first.

The answer of the question.

 

Sample Input

2

5 2
bwbwb
0 0 4
0 1 3
5 5
wbwbw
0 0 4
0 0 2
0 2 4
1 2 b
0 0 4

 

Sample Output

Case 1:
1
1
Case 2:
2
1
1
0

 

Source

The 36th ACM/ICPC Asia Regional Beijing Site —— Online Contest

 

Recommend

lcy

题目大意： T组数据，每组数据一个n,m，n表示字符串长度，m表示m个操作，接下来输入长度为n的数据，紧接着m组操作，每个操作起始 “0” 表示查询，紧接着会告诉区间，输出区间内连续的wbw这个子串的个数，“1”表示修改某个下表，修改为一个值

解题思路：用线段树维护即可

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int maxn=50010;
char st[maxn];
int n,m;
//wbw
struct node{
    int value,l,r;
    node(int l0=0,int r0=0,int value0=0){
        l=l0;r=r0;value=value0;
    }
}a[maxn*4];

void push_up(int k){
    a[k].value=a[2*k].value+a[2*k+1].value;
    if(st[a[2*k].r]!=st[a[2*k+1].l]){
        if(st[a[2*k].r]=='w' && a[2*k+1].l!=a[2*k+1].r && st[a[2*k+1].l+1]=='w'){
            a[k].value++;
        }
        if(st[a[2*k].r]=='b' && a[2*k].l!=a[2*k].r && st[a[2*k].r-1]=='w'){
            a[k].value++;
        }
    }
}

void build(int l,int r,int k){
    a[k].l=l;
    a[k].r=r;
    a[k].value=0;
    if(l!=r){
        int mid=(l+r)/2;
        build(l,mid,2*k);
        build(mid+1,r,2*k+1);
        push_up(k);
    }
}

void insert(int pos,char ch,int k){
    if(pos<=a[k].l && a[k].r<=pos){
        st[pos]=ch;
    }else{
        int mid=(a[k].l+a[k].r)/2;
        if(pos<=mid) insert(pos,ch,2*k);
        else insert(pos,ch,2*k+1);
        push_up(k);
    }
}

int query(int l,int r,int k){
    if(l<=a[k].l && a[k].r<=r){
        return a[k].value;
    }else{
        int mid=(a[k].l+a[k].r)/2;
        if(r<=mid) return query(l,r,2*k);
        else if(l>=mid+1) return query(l,r,2*k+1);
        else{
            int c=query(l,mid,2*k)+query(mid+1,r,2*k+1);
            if(st[mid]!=st[mid+1]){
                if(st[mid]=='w' && r>mid+1 && st[mid+2]=='w') c++;
                if(st[mid]=='b' && l<mid && st[mid-1]=='w') c++;
            }
            return c;
        }
    }
}

void computing(){
    int num;
    build(0,n-1,1);
    while(m-- >0){
        scanf("%d",&num);
        if(num){
            int pos;
            char ch;
            scanf("%d %c",&pos,&ch);
            insert(pos,ch,1);
        }else{
            int l,r;
            scanf("%d%d",&l,&r);
            printf("%d\n",query(l,r,1));
        }
    }
}

int main(){
    int t=0;
    scanf("%d",&t);
    for(int i=1;i<=t;i++){
        scanf("%d%d",&n,&m);
        scanf("%s",st);
        printf("Case %d:\n",i);
        computing();
    }
    return 0;
}