Submission #916919


Source Code Expand

#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;

signed main(){
	int n, a, b;
	cin >> n >> a >> b;
	string s;
	cin >> s;
	int now = 0, nb = 0;
	rep(i, 0, n){
		if(s[i] == 'a' && now < a + b){
			cout << "YES" << endl;
			now++;
		}else if(s[i] == 'b' && now < a + b && nb < b){
			cout << "YES" << endl;
			now++;
			nb++;
		}else{
			cout << "NO" << endl;
		}
	}
}

Submission Info

Submission Time
Task B - Qualification simulator
User treeone
Language C++14 (GCC 5.4.1)
Score 0
Code Size 569 Byte
Status WA
Exec Time 424 ms
Memory 896 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 200
Status
WA × 3
WA × 13
Set Name Test Cases
Sample s1.txt, s2.txt, s3.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, s1.txt, s2.txt, s3.txt
Case Name Status Exec Time Memory
01.txt WA 407 ms 768 KB
02.txt WA 415 ms 768 KB
03.txt WA 416 ms 768 KB
04.txt WA 412 ms 768 KB
05.txt WA 368 ms 768 KB
06.txt WA 418 ms 768 KB
07.txt WA 412 ms 896 KB
08.txt WA 424 ms 896 KB
09.txt WA 419 ms 768 KB
10.txt WA 414 ms 768 KB
s1.txt WA 3 ms 256 KB
s2.txt WA 3 ms 256 KB
s3.txt WA 3 ms 256 KB