Submission #4035487

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cmath>
#include <iomanip>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cassert>
#include <cstring>
#include <climits>

using namespace std;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define mp make_pair
#define fi first
#define se second
#define pb push_back

typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> V;
typedef map<int, int> M;

constexpr ll INF = 1e18;
constexpr ll MOD = 1e9 + 7;
constexpr double PI = 3.14159265358979323846;
constexpr int di[] = {0, 0, 1, -1};
constexpr int dj[] = {1, -1, 0, 0};

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n, a, b;
    string s;

    cin >> n >> a >> b >> s;

    int al = 0, fo = 0;
    REP(i, n)
    {
        bool res = false;

        if (s[i] == 'c')
        {
            res = false;
        }

        if (s[i] == 'b')
        {
            res = fo < b && al < a + b;
            fo += res;
            al += res;
        }

        if (s[i] == 'a')
        {
            res = al < a + b;
            al += res;
        }

        cout << (res ? "Yes" : "No") << endl;
    }

    return 0;
}

Submission Info

Judge Result