Submission #3577213

---

Source Code Expand

//cod2016_qualB_b.cpp
//Sat Nov 10 18:52:37 2018

#include <iostream>
#include <string>
#include <queue>
#include <unordered_map>
#include <vector>
#include <algorithm>
#include <math.h>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll=long long;
typedef pair<int,int> P;

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

	int totalqual = 0;
//	int aqual = 0;
	int bqual = 0;
	for (int i=0;i<s.size();i++){
		if (s[i] == 'a'){
			if (totalqual < a+b){
				cout << "Yes" << endl;
				totalqual++;
			}else {
				cout << "No" << endl;
			}
		}else if (s[i] == 'b'){
			if (totalqual < a+b && bqual < b){
				cout << "Yes" << endl;
				totalqual++;
				bqual++;
			}else{
				cout << "No" << endl;
			}
		}else {
			cout << "No" << endl;
		}
	}
}

Submission Info

Judge Result