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

直接模拟计算就可以，注意每次判断a,b的大小。。。

#include<iostream>
#include<string>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 2e5+7;
int v[maxn];
char s[maxn];
bool cmp(int a, int b)
{
    return a > b;
}

int main()
{
    int n, a1, a, b1, b,cast = 0;
    memset(v, 0, sizeof(v));
    scanf("%d%d%d", &n, &a1, &b1);
    scanf("%s",s);
    int i = 0;
    while(i<n)
    {
        while(s[i] == '*'&&i<n) i++;
        while(s[i] != '*'&&i<n) v[cast]++,i++;
        cast++;
    }
    //sort(v, v+cast, cmp);
    a = a1, b = b1;
    int sum = a+b;
    for(int i = 0; i < cast; i++)
    {
        if(a < b) swap(a, b);
        if(v[i]/2 < v[i] - (v[i]/2)) {
            a -= (v[i] - (v[i]/2));
            b -= v[i]/2;
        } else {
            b -= (v[i] - (v[i]/2));
            a -= v[i]/2;
        }
    }
    if(a < 0&&b < 0) printf("%d\n", sum);
    else if(a >= 0&&b >= 0)printf("%d\n", (sum - (a+b)));
    else if(a >= 0) printf("%d\n", (sum - a));
    else if(b >= 0) printf("%d\n", (sum - b));
    return 0;
}