Codeorces 570C Replacement【思维】

最新推荐文章于 2021-04-10 20:05:45 发布

mengxiang000000

最新推荐文章于 2021-04-10 20:05:45 发布

阅读量542

点赞数

分类专栏：思维文章标签： Codeorces 570C

本文链接：https://blog.csdn.net/mengxiang000000/article/details/54315626

版权

思维专栏收录该内容

692 篇文章 0 订阅

订阅专栏

Daniel has a string s, consisting of lowercase English letters and period signs (characters '.'). Let's define the operation of replacement as 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 x_i (1 ≤ x_i ≤ n) of string s is assigned value c_i. 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 x_i and c_i (1 ≤ x_i ≤ n, c_i — a lowercas English letter or a period sign), describing the query of assigning symbol c_i to position x_i.

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.

Examples

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

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.")

题目大意：

有一个长度为N的字符串，每一次操作对应改变一个位子的字符变成另外一种字符，对应一个字符串的贡献值为：f（s）；

f（s）的计算方法：对应每两个点归并成一个点，总共操作的次数就是f（s）的值。

问每次操作之后f（s）的值。

思路：

1、这种题好套路啊，我们只考虑改变的那个位子附近的变化即可：

①如果是从点变成其他：如果左边有点，ans--；如果右边有点，ans--；

②如果是从其他变成点：如果左边有点，ans++；如果右边有点，ans++；

2、那么我们求出最开始的F（s）之后，动态维护即可。

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
char a[507000];
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        scanf("%s",a+1);
        int ans=0;
        a[0]='a';a[n+1]='a';
        for(int i=1;i<=n;i++)
        {
            if(a[i]=='.'&&a[i+1]=='.')ans++;
        }
        while(m--)
        {
            int x;
            char s[50];
            scanf("%d%s",&x,s);
            if(s[0]!='.'&&a[x]=='.')
            {
                if(a[x-1]=='.')ans--;
                if(a[x+1]=='.')ans--;
            }
            if(s[0]=='.'&&a[x]!='.')
            {
                if(a[x-1]=='.')ans++;
                if(a[x+1]=='.')ans++;
            }
            a[x]=s[0];
            printf("%d\n",ans);
        }
    }
}