Educational Codeforces Round 42 (Rated for Div. 2)-B. 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.

题意：从左到右安排位置，要求相同类型的人不能相邻，问最多能安排多少个人。

题解：贪心法，每次在满足条件的情况下都要优先安排剩余人数最少的那一类人，再考虑安排剩余人数少的人，如果两者条件都不满足的话就不能安排人。在这里卡了好久，一直都找不出来自己的错，后来问了一位学长，他帮我看了代码才找出了我的错，这点很重要：要考虑其中一组的人为0的情况。就是这里让我卡了好久。

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;

const int maxn = 2 * 1e5 + 5;

int main()
{
    int n,na,nb,sum;
    char sit[maxn];
    while(scanf("%d%d%d",&n,&na,&nb) != EOF)
    {
        sum = na + nb;
        scanf("%s",sit + 1);
        sit[0] = '*';
        for(int i = 1;i <= n;i++)
        {
            if(na <= 0 && nb <= 0) break;
            if(sit[i] == '*') continue;
            if(na > nb)
            {
                if(sit[i - 1] != 'A' && na)
                {
                    na--;
                    sit[i] = 'A';
                }
                else if(nb)
                {
                    nb--;
                    sit[i] = 'B';
                }
            }
            else if(na < nb)
            {
                if(sit[i - 1] != 'B' && nb)
                {
                    nb--;
                    sit[i] = 'B';
                }
                else if(na)
                {
                    na--;
                    sit[i] = 'A';
                }
            }
            else if(na == nb)
            {
                if(sit[i - 1] == 'A' && nb)
                {
                    nb--;
                    sit[i] = 'B';
                }
                else if(na)
                {
                    na--;
                    sit[i] = 'A';
                }
            }
        }
        printf("%d\n",sum - na - nb);
    }
    return 0;
}