Submission #1162881

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <functional>
#include <cmath>
#include <complex>
#include <cctype>
#include <cassert>
#include <sstream>
#include <ctime>
 
using namespace std;
 
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
 
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;
typedef vector<pii> vp;

#define INF (1<<29)
#define INFL (1ll<<60)
#define EPS (1e-8)
#define PI (acos(-1))
const ll MOD = 1000000007ll;

int main() {
	int n, a, b;
	cin >> n >> a >>b;
	
	string s;
	cin >> s;
	
	int now = 0, cnt = 1;
	REP(i, s.size()) {
		bool ok = true;
		
		if (a + b <= now) ok = false;
		else {
			if (s[i] == 'b') {
				if (cnt <= b) cnt++;
				else ok = false;
			}
			if (s[i] == 'c') ok = false;
		}
		
		if (ok) {
			puts("Yes");
			now++;
		}
		else 
			puts("No");
	}
	
	return 0;
}

Submission Info

Judge Result