Submission #1662575

---

Source Code Expand

#include <bits/stdc++.h>
// iostream is too mainstream
#include <cstdio>
// bitch please
#include <iostream>
#include <algorithm>
#include <cstdlib>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <cmath>
#include <iomanip>
#include <time.h>
#define dibs reserve
#define OVER9000 1234567890123456789LL
#define ALL_THE(CAKE,LIE) for(auto LIE =CAKE.begin(); LIE != CAKE.end(); LIE++)
#define tisic 47
#define soclose 1e-8
#define chocolate win
// so much chocolate
#define patkan 9
#define ff first
#define ss second
#define abs(x) ((x < 0)?-(x):x)
#define uint unsigned int
#define dbl long double
#define pi 3.14159265358979323846
using namespace std;
// mylittledoge

typedef long long cat;

#ifdef DONLINE_JUDGE
	// palindromic tree is better than splay tree!
	#define lld I64d
#endif

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(10);
	int N,A,B;
	string S;
	cin >> N >> A >> B >> S;
	int passJ =0, passO =0;
	for(int i =0; i < N; i++) {
		if(S[i] == 'c') {
			cout << "No\n";
			continue;
		}
		if(S[i] == 'a') {
			if(passJ+passO < A+B) {
				passJ++;
				cout << "Yes\n";
			}
			else cout << "No\n";
		}
		if(S[i] == 'b') {
			if(passJ+passO < A+B && passO < B) {
				passO++;
				cout << "Yes\n";
			}
			else cout << "No\n";
		}
	}
	return 0;}

// look at my code
// my code is amazing

Submission Info

Judge Result