Educational Codeforces Round 42 (Rated for Div. 2) B. Students in Railway Carriage题解

最新推荐文章于 2020-09-03 12:46:10 发布

Yolo_Fs

最新推荐文章于 2020-09-03 12:46:10 发布

阅读量295

点赞数

CC 4.0 BY-SA版权

分类专栏： Codeforce 文章标签： CodeForce

本文链接：https://blog.youkuaiyun.com/Hacker_Wind/article/details/79905037

Codeforce 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一个竞赛编程题目，目标是最优地安排学生程序员和学生运动员在火车车厢内的座位，确保没有两个相同类型的学生相邻而坐。文章提供了完整的代码实现及示例输入输出。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 \leq n \leq 2 \cdot 10^{5}

0 \leq a, b \leq 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

Input

Copy

6 2 3
*...*.

Output

Copy

Input

Copy

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

Output

Copy

Input

Copy

3 2 3
***

Output

Copy

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.

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#include <cmath>
using namespace std;
//#define PI 3.14159265358979323
#define inf 0x3f3f3f3f
int main()
{
    int n,a,b;
    cin>>n>>a>>b;
    string s;
    cin>>s;
    int ans=0;
    for(int i=0; i<n; i++)
    {
        if(a<b)
            swap(a,b);
        while(s[i]=='.'&&i<n)
        {
            if(a>0)
                ans++;
            a--;
            swap(a,b);
            i++;

        }
    }
    cout<<ans<<endl;
    return 0;
}