Submission #1216058

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
#define REP(i,s,n) for(int i=s; i<n; ++i)
#define rep(i,n) REP(i,0,n)
#define SORT(c) sort((c).begin(),(c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
 
typedef long long ll;
typedef pair<int, int> ii;
 
int main(){
 
  int n, a, b;
  cin >> n >> a >> b;
  string s;
  cin >> s;
 
  int ab = a + b, sum = 0, cnt = 0;
 
  rep(i, s.size()){
    if(s[i] == 'a'){
      if(sum < ab){
        cout << "Yes" <<endl;
        sum++;
      }
      else cout << "No" <<endl;
    }
    else if(s[i] == 'b'){
      if(sum < ab && cnt < b){
        cout << "Yes" <<endl;
        sum++;
        cnt++;
      }
      else cout << "No" <<endl;
    }
    else cout << "No" <<endl;
 
  }
 
  return 0;
}

Submission Info

Judge Result