Codeforces Codeforces Round #316 (Div. 2) C. Replacement 线段树
C. Replacement
Time Limit: 20 Sec
Memory Limit: 256 MB
题目连接
http://codeforces.com/contest/570/problem/C
Description
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 Input
10 3
.b..bz....
1 h
3 c
9 f
Sample Output
4
3
1
HINT
题意
给你一个字符串,然后每两个点可以变成一个点
然后有m次修改操作,每次可以修改一个位置的字符
然后问你修改之后,需要多少次操作,把所有的点,都变成连续的一个点
题解:
我比较蠢,我用的线段树,太蠢了
正解不超过30行,几个if就好了……
维护的是每一个pos的左边的字母和右边的字母位置
代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <stack>
using namespace std; #define LL(x) (x<<1)
#define RR(x) (x<<1|1)
#define MID(a,b) (a+((b-a)>>1))
const int N=; struct node
{
int lft,rht;
int lmx,rmx;
int len(){return rht-lft+;}
int mid(){return MID(lft,rht);}
void init(){lmx=rmx=len();}
void fun(int valu)
{
if(valu==-) lmx=rmx=;
else lmx=rmx=;
}
}; int n,m; struct Segtree
{
node tree[N*];
void up(int ind)
{
tree[ind].lmx=tree[LL(ind)].lmx;
tree[ind].rmx=tree[RR(ind)].rmx;
if(tree[LL(ind)].lmx==tree[LL(ind)].len())
tree[ind].lmx+=tree[RR(ind)].lmx;
if(tree[RR(ind)].rmx==tree[RR(ind)].len())
tree[ind].rmx+=tree[LL(ind)].rmx;
}
void build(int lft,int rht,int ind)
{
tree[ind].lft=lft,tree[ind].rht=rht;
tree[ind].init();
if(lft!=rht)
{
int mid=tree[ind].mid();
build(lft,mid,LL(ind));
build(mid+,rht,RR(ind));
}
}
void updata(int pos,int ind,int valu)
{
if(tree[ind].lft==tree[ind].rht) tree[ind].fun(valu);
else
{
int mid=tree[ind].mid();
if(pos<=mid) updata(pos,LL(ind),valu);
else updata(pos,RR(ind),valu);
up(ind);
}
}
void query(int pos,int ind,int& x,int& y)
{
if(tree[ind].lft==tree[ind].rht)
{
if(tree[ind].lmx==) x=y=tree[ind].lft;
else x=y=;
}
else
{
int mid=tree[ind].mid();
if(pos<=mid) query(pos,LL(ind),x,y);
else query(pos,RR(ind),x,y);
if(tree[LL(ind)].rht==y) y+=tree[RR(ind)].lmx;
if(tree[RR(ind)].lft==x) x-=tree[LL(ind)].rmx;
}
}
}seg;
char s[N];
int vis[N];
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
scanf("%s",s+);
seg.build(,n+,);
int len=strlen(s+);
int ans=;
int tmp=;
seg.updata(n+,,-);
for(int i=;i<=len;i++)
{
if(s[i]=='.')
tmp++;
else
{
if(tmp!=)
ans+=(tmp-);
tmp=;
seg.updata(i,,-);
vis[i]=;
}
}
if(tmp!=)
ans+=(tmp-);
while(m--)
{
char cmd[];
int pos,st,ed;
scanf("%d",&pos);
scanf("%s",&cmd);
if(cmd[]!='.')
{
if(vis[pos]==)
printf("%d\n",ans);
else
{
vis[pos]=; seg.query(pos,,st,ed);
ans-=(ed-st);
seg.updata(pos,,-);
seg.query(pos+,,st,ed);
ans+=(ed-st);
if(pos-!=)
{
seg.query(pos-,,st,ed);
ans+=(ed-st);
}
printf("%d\n",ans);
} }
else
{
if(vis[pos]==)
printf("%d\n",ans);
else
{
vis[pos]=;
seg.query(pos+,,st,ed);
ans-=(ed-st);
if(pos-!=)
{
seg.query(pos-,,st,ed);
ans-=(ed-st);
}
seg.updata(pos,,);
seg.query(pos,,st,ed);
ans+=(ed-st);
printf("%d\n",ans); }
}
}
}
return ;
}
Codeforces Codeforces Round #316 (Div. 2) C. Replacement 线段树的更多相关文章
- Codeforces Round #603 (Div. 2) E. Editor 线段树
E. Editor The development of a text editor is a hard problem. You need to implement an extra module ...
- Codeforces Round #406 (Div. 1) B. Legacy 线段树建图跑最短路
B. Legacy 题目连接: http://codeforces.com/contest/786/problem/B Description Rick and his co-workers have ...
- Codeforces Round #765 Div.1 F. Souvenirs 线段树
题目链接:http://codeforces.com/contest/765/problem/F 题意概述: 给出一个序列,若干组询问,问给出下标区间中两数作差的最小绝对值. 分析: 这个题揭示着数据 ...
- 【转】Codeforces Round #406 (Div. 1) B. Legacy 线段树建图&&最短路
B. Legacy 题目连接: http://codeforces.com/contest/786/problem/B Description Rick and his co-workers have ...
- Codeforces Codeforces Round #316 (Div. 2) C. Replacement set
C. Replacement Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/570/proble ...
- Codeforces Round #316 (Div. 2) C. Replacement
题意:给定一个字符串,里面有各种小写字母和' . ' ,无论是什么字母,都是一样的,假设遇到' . . ' ,就要合并成一个' .',有m个询问,每次都在字符串某个位置上将原来的字符改成题目给的字符, ...
- Codeforces Round #316 (Div. 2) C. Replacement(线段树)
C. Replacement time limit per test 2 seconds memory limit per test 256 megabytes input standard inpu ...
- Codeforces Round #316 (Div. 2C) 570C Replacement
题目:Click here 题意:看一下题目下面的Note就会明白的. 分析:一开始想的麻烦了,用了树状数组(第一次用)优化,可惜没用. 直接判断: #include <bits/stdc++. ...
- Codeforces Round #316 (Div. 2) C Replacement 扫描法
先扫描一遍得到每个位置向后连续的'.'的长度,包含自身,然后在扫一遍求出初始的合并次数. 对于询问,只要对应位置判断一下是不是'.',以及周围的情况. #include<bits/stdc++. ...
随机推荐
- TCP/IP详解学习笔记(1)-基本概念
为什么会有TCP/IP协议 在世界上各地,各种各样的电脑运行着各自不同的操作系统为大家服务,这些电脑在表达同一种信息的时候所使用的方法是千差万别.就好像圣经中上帝打乱了各地人的口音,让他们无法合作一样 ...
- 擦亮自己的眼睛去看SQLServer之简单Select(转)
摘要:这篇文章主要和大家讨论几乎所有人都熟悉,但不少人又陌生的一条select语句. 这篇文章主要和大家讨论几乎所有人都熟悉,但不少人又陌生的一条select语句.不知道大家有没有想过到底是什么东西让 ...
- 取requests返回字典值用json()
python模块requests返回值用json()["h"][key]可以取出下面的value
- [原创]Android应用 - YE启动器APP(YeLauncherApp)
支持解冻.冻结APP 支持在本APP列表隐藏指定APP 支持检测系统核心APP,防止误点冻结导致手机变砖 支持清理APP缓存 支持强制停止APP Apk文件仅仅47KB 自用.开源 类似APP:A ...
- 利用flashback query 恢复表数据
flashback query可以查询过去某个时间点对象的状态,从而可以利用此来进行恢复数据 1 准备测试数据 用普通用户创建一个表,表中插入部分数据: SQL> show user USER ...
- Echarts显示全球dns server物理位置
今天YY给了我一大串dns server的ip,然后提出将这些ip物理位置显示在世界地图上(仅仅显示每个地区有几个dns server就好),苦逼了一下午,总算告一段落.把里面关键的点贴上来以后看.. ...
- 叉积判断 POJ1696
// 叉积判断 POJ1696 #include <iostream> #include <algorithm> #include <cstring> #inclu ...
- 在Windows上,如何卸载RabbitMQ服务
打开运行->CMD->sc delete RabbitMQ 如果报错..... 打开运行->regedit 找到RabbitMQ节点,删掉即可.(右侧看到的都是启动服务时,需要的配置 ...
- RabbitMQ (五)主题(Topic) -摘自网络
虽然使用direct类型改良了我们的系统,但是仍然存在一些局限性:它不能够基于多重条件进行路由选择. 在我们的日志系统中,我们有可能希望不仅根据日志的级别而且想根据日志的来源进行订阅.这个概念类似un ...
- How to fix “X: user not authorized to run the X server, aborting.”? -摘自网络
This is just a simple tips to solve a error message when you start your X session with “startx” comm ...