Submission #941708
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 o(a) cout << a << endl #define int long long #define first first #define second se using namespace std; typedef pair<int, int> P; typedef vector<int> vi; signed main(){ string s; int n, a, b; int na = 0, nb = 0; cin >> n >> a >> b >> s; rep(i, 0, s.size()){ if(s[i] == 'a' && (na + nb) < (a + b)){ o("Yes"); na++; }else if(s[i] == 'b' && (na + nb) <(a + b) && nb < b){ o("Yes"); nb++; }else{ o("No"); } } }
Submission Info
Submission Time | |
---|---|
Task | B - Qualification simulator |
User | treeone |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 716 Byte |
Status | AC |
Exec Time | 424 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 | 414 ms | 768 KB |
02.txt | AC | 415 ms | 768 KB |
03.txt | AC | 421 ms | 768 KB |
04.txt | AC | 423 ms | 768 KB |
05.txt | AC | 367 ms | 768 KB |
06.txt | AC | 421 ms | 768 KB |
07.txt | AC | 424 ms | 896 KB |
08.txt | AC | 423 ms | 896 KB |
09.txt | AC | 413 ms | 768 KB |
10.txt | AC | 419 ms | 896 KB |
s1.txt | AC | 3 ms | 256 KB |
s2.txt | AC | 3 ms | 256 KB |
s3.txt | AC | 3 ms | 256 KB |