2011北京网络赛G
2011-09-18 20:35
120 查看
忘记里给改过的字符替换掉 自己没有想到两个端点如果中间容纳不下3个字符的时候输出0 后来看了别人的代码 改过这两处才对
G Panda
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
G Panda
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
#include<iostream> #include<stdio.h> #include<cstring> using namespace std; int n; int a[50001]; void add(int x,int y)//改变下表为x的元素的值 会导致所有x的父节点的值的改变 { for(;x<=n;x+=x&-x) a[x]+=y; } int sum1(int x) { int ans=0; for(;x>0;x-=x&-x) { ans+=a[x]; } return ans; } int main() { int m; char str[50001]; int t; cin>>t; for(int ll=1;ll<=t;ll++) { scanf("%d %d",&n,&m); scanf("%s",str+1); memset(a,0,sizeof(a)); for(int i=2;i<n;i++) { if(str[i]=='b'&&str[i-1]=='w'&&str[i+1]=='w') { add(i,1); } } printf("Case %d:\n",ll); for(int i=1;i<=m;i++) { int k,q,p; char c; scanf("%d %d",&k,&q); if(k==0) { scanf("%d",&p); if(p<q+2)//自己考虑里两个端点中间不够一组"wbw"的情况 { printf("0\n");continue; } int summ=0; summ=sum1(p+1)-sum1(q); if(str[q+1]=='b'&&str[q+2]=='w'&&str[q]=='w') summ--; if(str[p+1]=='b'&&str[p+2]=='w'&&str[p]=='w') summ--; printf("%d\n",summ); } else { scanf("\n%c",&c); if(str[q+1]!=c) if(c=='w') { if(str[q-1]=='w'&&str[q]=='b') add(q,1); if(str[q]=='w'&&str[q+2]=='w') add(q+1,-1); if(str[q+2]=='b'&&str[q+3]=='w') add(q+2,1); } else if(c=='b') { if(str[q-1]=='w'&&str[q]=='b') add(q,-1); if(str[q]=='w'&&str[q+2]=='w') add(q+1,1); if(str[q+2]=='b'&&str[q+3]=='w') add(q+2,-1); } str[q+1]=c; } } } return 0; }
相关文章推荐
- 2011东北地区赛G题(二分-网络流判可行性)
- 北京网络赛G BOXES 状态压缩+有序BFS+高维数组判重
- 套题总结:2011北京网络赛
- Eliminate Witches! [2011 北京网络赛]
- 2011ACM北京网络赛前夕热身赛 起重机
- HDU/HDOJ 4045 BUPT 216 Machine scheduling 2011ACM北京网络赛 F题
- HDU/HDOJ 4043 BUPT 235 FXTZ II 2011ACM北京网络赛 D题
- Android中观察者模式的实现--第二届 Google 暑期大学生博客分享大赛 - 2011 Android 成长篇
- hihocoder1236(北京网络赛J):scores 分块+bitset
- MS CRM 2011官方用户手册和管理员手册
- [bzoj2301: [HAOI2011]Problem b] 乞讨
- 2011阿里巴巴程序设计公开赛 / 解题报告 8.18
- 【bzoj2438】 [中山市选2011]杀人游戏 强连通分量
- CVE2011-0065-Mozilla Firefox3.6.16 mChannel use after free vulnerability
- 【bzoj2441】 中山市选2011小W的问题 线段树
- hadoop权威指南--NCDC1929-2011数据下载地址
- NOIP2011 计算系数
- CRM 2011 Distribute Workflow Activity (MSCRM 2011 分派工作流活动)
- BZOJ 2435: [Noi2011]道路修建( dfs )
- 8/27/2011 2:53:01 AM