C. Replacement-----(Codeforces Round #316 (Div. 2))
2015-08-14 16:10
555 查看
C. Replacement
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Daniel has a string s, consisting of lowercase English letters and period signs (characters '.').
Let's define the operation of replacementas the following sequence of steps: find a substring ".."
(two consecutive periods) in string s, of all occurrences of the substring let's choose the first one, and replace this substring
with string ".". In other words, during the replacement operation, the first two consecutive periods are replaced by one. If string s contains
no two consecutive periods, then nothing happens.
Let's define f(s) as the minimum number of operations of replacement to
perform, so that the string does not have any two consecutive periods left.
You need to process m queries, the i-th
results in that the character at position xi (1 ≤ xi ≤ n)
of string s is assigned value ci.
After each operation you have to calculate and output the value of f(s).
Help Daniel to process all queries.
Input
The first line contains two integers n and m (1 ≤ n, m ≤ 300 000)
the length of the string and the number of queries.
The second line contains string s, consisting of n lowercase
English letters and period signs.
The following m lines contain the descriptions of queries. The i-th
line contains integer xi and ci (1 ≤ xi ≤ n, ci —
a lowercas English letter or a period sign), describing the query of assigning symbol ci to
position xi.
Output
Print m numbers, one per line, the i-th
of these numbers must be equal to the value of f(s) after performing the i-th
assignment.
Sample test(s)
input
output
input
output
Note
Note to the first sample test (replaced periods are enclosed in square brackets).
The original string is ".b..bz....".
after the first query f(hb..bz....) =
4 ("hb[..]bz...." → "hb.bz[..].." → "hb.bz[..]." → "hb.bz[..]" → "hb.bz.")
after the second query f(hbс.bz....) =
3 ("hbс.bz[..].." → "hbс.bz[..]." → "hbс.bz[..]" → "hbс.bz.")
after the third query f(hbс.bz..f.) =
1 ("hbс.bz[..]f." → "hbс.bz.f.")
Note to the second sample test.
The original string is ".cc.".
after the first query: f(..c.) =
1 ("[..]c." → ".c.")
after the second query: f(....) =
3 ("[..].." → "[..]." → "[..]" → ".")
after the third query: f(.a..) =
1 (".a[..]" → ".a.")
after the fourth query: f(aa..) =
1 ("aa[..]" → "aa.")
分析:暴力解决肯定不行,会TLE。
思路:找规律。
CODE:
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Daniel has a string s, consisting of lowercase English letters and period signs (characters '.').
Let's define the operation of replacementas the following sequence of steps: find a substring ".."
(two consecutive periods) in string s, of all occurrences of the substring let's choose the first one, and replace this substring
with string ".". In other words, during the replacement operation, the first two consecutive periods are replaced by one. If string s contains
no two consecutive periods, then nothing happens.
Let's define f(s) as the minimum number of operations of replacement to
perform, so that the string does not have any two consecutive periods left.
You need to process m queries, the i-th
results in that the character at position xi (1 ≤ xi ≤ n)
of string s is assigned value ci.
After each operation you have to calculate and output the value of f(s).
Help Daniel to process all queries.
Input
The first line contains two integers n and m (1 ≤ n, m ≤ 300 000)
the length of the string and the number of queries.
The second line contains string s, consisting of n lowercase
English letters and period signs.
The following m lines contain the descriptions of queries. The i-th
line contains integer xi and ci (1 ≤ xi ≤ n, ci —
a lowercas English letter or a period sign), describing the query of assigning symbol ci to
position xi.
Output
Print m numbers, one per line, the i-th
of these numbers must be equal to the value of f(s) after performing the i-th
assignment.
Sample test(s)
input
10 3 .b..bz.... 1 h 3 c 9 f
output
4 3 1
input
4 4 .cc. 2 . 3 . 2 a 1 a
output
1 3 1 1
Note
Note to the first sample test (replaced periods are enclosed in square brackets).
The original string is ".b..bz....".
after the first query f(hb..bz....) =
4 ("hb[..]bz...." → "hb.bz[..].." → "hb.bz[..]." → "hb.bz[..]" → "hb.bz.")
after the second query f(hbс.bz....) =
3 ("hbс.bz[..].." → "hbс.bz[..]." → "hbс.bz[..]" → "hbс.bz.")
after the third query f(hbс.bz..f.) =
1 ("hbс.bz[..]f." → "hbс.bz.f.")
Note to the second sample test.
The original string is ".cc.".
after the first query: f(..c.) =
1 ("[..]c." → ".c.")
after the second query: f(....) =
3 ("[..].." → "[..]." → "[..]" → ".")
after the third query: f(.a..) =
1 (".a[..]" → ".a.")
after the fourth query: f(aa..) =
1 ("aa[..]" → "aa.")
分析:暴力解决肯定不行,会TLE。
思路:找规律。
CODE:
#include <bits/stdc++.h> using namespace std; int main() { const int maxn=300005; int n,m; while(cin>>n>>m){ char ch[maxn]; memset(ch,0,sizeof(ch)); cin>>ch; int cnt=0,ans=0; for(int i=0;i<n;i++){ if(ch[i]=='.') cnt++; else{ if(cnt>1) ans+=(cnt-1); cnt=0; } } if(cnt>1) ans+=(cnt-1); int a; char c; while(m--){ cin>>a>>c; a-=1; if(a>0&&a<n-1){ if(c=='.'&&ch[a]!='.'){ if(ch[a-1]=='.'&&ch[a+1]=='.') ans+=2; else if(ch[a-1]=='.'||ch[a+1]=='.') ans+=1; } else if(c!='.'&&ch[a]=='.'){ if(ch[a-1]=='.'&&ch[a+1]=='.') ans-=2; else if(ch[a-1]=='.'||ch[a+1]=='.') ans-=1; } } else if(a==0){ if(c=='.'&&ch[a]!='.'){ if(ch[a+1]=='.') ans+=1; } else if(c!='.'&&ch[a]=='.'){ if(ch[a+1]=='.') ans-=1; } } else if(a==n-1){ if(c=='.'&&ch[a]!='.'){ if(ch[a-1]=='.') ans+=1; } else if(c!='.'&&ch[a]=='.'){ if(ch[a-1]=='.') ans-=1; } } ch[a]=c; cout<<ans<<endl; } } return 0; }
相关文章推荐
- awk学习
- 手机APP
- 黑马程序员--Java之IO流
- MongoDB之索引
- 20个高级面试总结
- C++ CTime COleTime的一些操作技巧
- css定义多重背景动画
- C++,你是真实的世界
- android 监听其它app的错误或者崩溃的方法 (ProcessErrorStateInfo)
- android apk嵌套 从一个apk启动另外一个apk
- 网络设备开军火发库(libnet,libpcap,pfring,dpdk)
- python—networkx:求图的平均路径长度并画出直方图
- matlab/C混合编程--mex文件的编写、编译、调用
- 118 Pascal's Triangle
- 前端设计之CSS布局:上中下三栏自适应高度CSS布局
- hdu oj 2176 取(m堆)石子游戏
- ibatis 中isNull, isNotNull与isEmpty, isNotEmpty区别
- 使用java的wsimport.exe工具生成wsdl的客户端代码
- Web开发中需要了解的东西
- Android基于mAppWidget实现手绘地图(十二)–显示当前用户位置