Codeforces Round #316 (Div. 2) C. Replacement

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

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

题意

给出一个字符串s，只包含小写字母和字符’.’，定义一种操作，可以将一个子串”..”替换为”.”，定义函数$f(s)$为最多可操作的次数。每次询问替换掉字符串中一个字符。问替换后的$f(s)$值。

题解

对于一串连续的$n$个’.’，最多可进行的操作数为$n-1$。首先预处理出初始的 f <script type="math/tex" id="MathJax-Element-1571">f</script>，之后对于每次询问，只有两种情况需要考虑，字母替换为’.’或相反。对于字母替换为’.’的情况，可能会将两段’.’连接起来(两段可能为空)。首先考虑左边，如果左边存在’.’，那么进行完全部操作后(可能为0)必定剩下一个’.’，与加入的’.’连在一起又可以进行一次操作，右边有’.’同理。对于将’.’替换为字母的操作，可视为上面的逆过程。用同样的方法处理。

代码

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <queue>
#define fout freopen("out.txt","w",stdout)
#define fin freopen("in.txt","r",stdin)

using namespace std;

char s[300005];
int n,m;
int f=0;
int num=0;
int p;
int l,r;
int main()
{
    scanf("%d%d",&n,&m);
    s[0]=0;
    scanf("%s",s+1);
    for(int i=1;i<=n;i++)
    {
        if(s[i]=='.')
            num++;
        else if(s[i-1]=='.')
        {
            f+=num-1;
            num=0;
        }
    }
    if(num)
        f+=num-1;
    while(m--)
    {
        scanf("%d %c",&p,&s[0]);
        if(s[p]=='.'&&s[0]!='.')
        {
            if(p>1&&s[p-1]=='.')
                f--;
            if(p<n&&s[p+1]=='.')
                f--;
        }
        else if(s[p]!='.'&&s[0]=='.')
        {
            if(p>1&&s[p-1]=='.')
                f++;
            if(p<n&&s[p+1]=='.')
                f++;
        }
        s[p]=s[0];
        printf("%d\n",f);
    }
    return 0;
}