Submission #1455655
Source Code Expand
#include <iostream> #include <string> #include <vector> #include <algorithm> #include <utility> #include <cmath> #include <numeric> #include <fstream> #include <queue> #include <cstdio> #include <deque> #include <map> #define fol(i,n) for(int i=0;i<n;i++) #define db(a) cout << a<< endl; using namespace std; int main(){ int n,a,b; string s; cin >> n >> a>> b>>s; int ps=a+b; fol(i,n){ if (s[i]=='a'||s[i]=='b'){ if (s[i]=='a'){ if (ps!=0) {cout << "Yes" <<endl;ps--;} else cout << "No" <<endl; }else{ if (ps!=0&&b!=0) {cout << "Yes" <<endl;b--;ps--;} else cout << "No" <<endl; } } else cout << "No" <<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Qualification simulator |
User | ravie403 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 812 Byte |
Status | AC |
Exec Time | 158 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 | 155 ms | 768 KB |
02.txt | AC | 157 ms | 768 KB |
03.txt | AC | 156 ms | 768 KB |
04.txt | AC | 156 ms | 768 KB |
05.txt | AC | 137 ms | 768 KB |
06.txt | AC | 153 ms | 768 KB |
07.txt | AC | 156 ms | 896 KB |
08.txt | AC | 155 ms | 896 KB |
09.txt | AC | 157 ms | 768 KB |
10.txt | AC | 158 ms | 768 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |