Submission #1654193

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 1000000000
#define LINF 9000000000000000000
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define rsort(x) sort(all(x));reverse(all(x))
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
bool debug=false;
/*---------------------------------------------------*/

int main(){
  int n,a,b;
  int pass_a=0,pass_b=0,rank=1;
  string s;
  cin>>n>>a>>b;
  cin>>s;
  rep(i,s.size()){
    if(s[i]=='a'){
      if(pass_a+pass_b<a+b){
	cout<<"Yes"<<endl;
	pass_a++;
      }else{
	cout<<"No"<<endl;
      }
    }else if(s[i]=='b'){
      if(pass_a+pass_b<a+b&&rank<=b){
	cout<<"Yes"<<endl;
	rank++;
	pass_b++;
      }else{
	cout<<"No"<<endl;
      }
    }else{
      cout<<"No"<<endl;
    }
  }
  return 0;
}

Submission Info

Judge Result