提出 #1555273

---

ソースコード 拡げる

#include <iostream>
#include <cstdio>
#include <string>
#include <queue>
#include <stack>
#include <list>
#include <algorithm>
#include <vector>
#define REP(i,n) for(int i=0;i<n;i++)
#define P 1000000007
using namespace std;

int powmp(long long x,long long n){
	const long long p = 1000000007;
	if(n==0) return 1;
	long long y = x%p;
	if(n==1) return y;
	long long tmp = (powmp(y,n/2))%p;
	if(n%2==0) return (tmp*tmp)%p;
	else return (powmp(y,n-1)*y)%p;
}

int main(int argc, char const *argv[])
{
	int n,a,b;
	cin >> n >> a >> b;
	int c = 0;
	int cf = 0;
	string str;
	cin >> str;
	REP(i,n){
		if(str[i]=='a'){
			if(c<a+b){
				cout << "Yes" << "\n";
				c++;
			}
			else cout <<"No"<<"\n";
		}
		else if(str[i]=='b'){
			if(c<a+b&&cf<b){
				cout << "Yes" << "\n";
				c++;
			}
			else cout <<"No"<<"\n";
			cf++;
		}
		else{
			cout <<"No"<<"\n";
		}
	}

	cout << "\n";
	return 0;
}	

提出情報

ジャッジ結果