Submission #1441902
Source Code Expand
#include <algorithm> #include <cstdio> #include <iostream> #include <map> #include <cmath> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <vector> #include <stdlib.h> #include <stdio.h> #include <bitset> using namespace std; #define FOR(I,A,B) for(int I = (A); I < (B); ++I) typedef long long ll; int main() { int N, A, B; cin >> N >> A >> B; string s; cin >> s; int a = 0, b = 0; FOR(i,0,N) { if(s[i]=='a') { if(a+b < A+B) { puts("Yes"); a++; } else { puts("No"); } } else if(s[i]=='b') { if(a+b<A+B && b + 1 <= B) { puts("Yes"); b++; } else { puts("No"); } } else { puts("No"); } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Qualification simulator |
User | nenuon |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 811 Byte |
Status | AC |
Exec Time | 7 ms |
Memory | 896 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
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 | AC | 7 ms | 768 KB |
02.txt | AC | 7 ms | 768 KB |
03.txt | AC | 7 ms | 768 KB |
04.txt | AC | 7 ms | 768 KB |
05.txt | AC | 6 ms | 768 KB |
06.txt | AC | 6 ms | 768 KB |
07.txt | AC | 7 ms | 896 KB |
08.txt | AC | 7 ms | 896 KB |
09.txt | AC | 6 ms | 768 KB |
10.txt | AC | 6 ms | 768 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |