Algorithm


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 na and b (1n21051≤�≤2⋅1050a,b21050≤�,�≤2⋅105a+b>0�+�>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.

 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

vector<int> inv;

int main() {
	int n, a, b;
	cin >> n >> a >> b;

	string s;
	cin >> s;

	for(int i = 0; i < s.length(); ++i) {
		if(s[i] == '.') {
			int t1 = i;
			while(i < s.length() && s[i] == '.') {
				++i;
			}
			int t2 = i - 1;
			inv.push_back(t2 - t1 + 1);
		}
	}

	if(inv.size() == 0) {
		cout << 0 << endl;
		return 0;
	}

	int res = 0;
	for(int i = 0; i < inv.size(); ++i) {
		if(inv[i] % 2 == 0) {
			if(a >= inv[i] / 2) {
				a -= inv[i] / 2;
				res += inv[i] / 2;
			} else {
				res += a;
				a -= a;
			}

			if(b >= inv[i] / 2) {
				b -= inv[i] / 2;
				res += inv[i] / 2;
			} else {
				res += b;
				b -= b;
			}
		} else {
			int t1 = inv[i] / 2, t2 = inv[i] - t1;

			if(a < b) {
				if(b <= t1) {
					b -= t1;
					res += t1;
				} else {
					res += b;
					b -= b;
				}

				if(a <= t2) {
					a -= t2;
					res += t2;
				} else {
					res += a;
					a -= a;
				}
			} else {
				if(a <= t1) {
					a -= t1;
					res += t1;
				} else {
					res += a;
					a -= a;
				}

				if(b <= t2) {
					b -= t2;
					res += t2;
				} else {
					res += b;
					b -= b;
				}
			}
		}
	}

	cout << res << endl;

  return 0;
}
Copy The Code & Try With Live Editor

Input

x
+
cmd
5 1 1
*...*

Output

x
+
cmd
2
Advertisements

Demonstration


Codeforces Solution-B. Students in Railway Carriage-Solution in C, C++, Java, Python

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+