962B Students in Railway Carriage

B. Students in Railway Carriage

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

There are $n$ consecutive seat places in a railway carriage. Each place is either empty or occupied by a passenger.

The university team for the Olympiad consists of $a$ student-programmers and $b$ student-athletes. Determine the largest number of students from all $a+b$ students, which you can put in the railway carriage so that:

• no student-programmer is sitting next to the student-programmer;
• and no student-athlete is sitting next to the student-athlete.

In the other words, there should not be two consecutive (adjacent) places where two student-athletes or two student-programmers are sitting.

Consider that initially occupied seat places are occupied by jury members (who obviously are not students at all).

Input

The first line contain three integers $n$, $a$ and $b$ ($1\le n\le 2\cdot {10}^5$, $0\le a,b\le 2\cdot {10}^5$, $a+b>0$) — total number of seat places in the railway carriage, the number of student-programmers and the number of student-athletes.

The second line contains a string with length $n$, consisting of characters "." and "*". The dot means that the corresponding place is empty. The asterisk means that the corresponding place is occupied by the jury member.

Output

Print the largest number of students, which you can put in the railway carriage so that no student-programmer is sitting next to a student-programmer and no student-athlete is sitting next to a student-athlete.

Examples

input

Copy

5 1 1
*...*

output

Copy

2

input

Copy

6 2 3
*...*.

output

Copy

4

input

Copy

11 3 10
.*....**.*.

output

Copy

7

input

Copy

3 2 3
***

output

Copy

0

Note

In the first example you can put all student, for example, in the following way: *.AB*

In the second example you can put four students, for example, in the following way: *BAB*B

In the third example you can put seven students, for example, in the following way: B*ABAB**A*B

The letter A means a student-programmer, and the letter B — student-athlete.

题意：一个地铁有n座位，现在有a类参加算法学生，和b类参加运动比赛的学生。不能让相同的类的学生相邻而坐。也就是a不能和a坐，b不能和b坐。输入一串字符，.代表空座位，*代表有人已经坐了。现在让你求出可以运输的学生的最大人数。
题解：贪心  先让a，b多的那一类人先坐一个，然后轮流坐最好，如果只有一类学生，那就隔开坐。

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,a,b,ans=0;
    string s;
    cin>>n>>a>>b>>s;
    for(int i=0; i<s.size(); i++)
    {
        if(s[i]=='.')
        {
            if(a>=b)
            {
                if(s[i-1]!='a'&&a)
                    s[i]='a',ans++,a--;
                else if(s[i-1]!='b'&&b)
                    s[i]='b',ans++,b--;
            }
            else
            {
                if(s[i-1]!='b'&&b)
                    s[i]='b',ans++,b--;
                else  if(s[i-1]!='a'&&a)
                    s[i]='a',ans++,a--;
            }
        }
    }
    cout<<ans<<endl;
    return 0;
}