Submission #1216057
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define REP(i,s,n) for(int i=s; i<n; ++i) #define rep(i,n) REP(i,0,n) #define SORT(c) sort((c).begin(),(c).end()) #define IINF INT_MAX #define LLINF LLONG_MAX typedef long long ll; typedef pair<int, int> ii; int main(){ int n, a, b; cin >> n >> a >> b; string s; cin >> s; int ab = a + b, sum = 0, cnt = 0; rep(i, s.size()){ if(s[i] == 'a'){ if(sum < ab){ cout << "Yes" <<endl; sum++; } else cout << "No" <<endl; } else if(s[i] == 'b'){ if(sum < ab && cnt < b){ cout << "Yes" <<endl; cnt++; } else cout << "No" <<endl; } else cout << "No" <<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Qualification simulator |
User | letter |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 767 Byte |
Status | WA |
Exec Time | 162 ms |
Memory | 896 KB |
Judge Result
Set Name | Sample | All | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 | WA | 155 ms | 768 KB |
02.txt | AC | 162 ms | 768 KB |
03.txt | AC | 154 ms | 768 KB |
04.txt | AC | 157 ms | 768 KB |
05.txt | AC | 136 ms | 768 KB |
06.txt | WA | 153 ms | 768 KB |
07.txt | AC | 154 ms | 896 KB |
08.txt | AC | 158 ms | 896 KB |
09.txt | AC | 152 ms | 768 KB |
10.txt | AC | 152 ms | 768 KB |
s1.txt | WA | 1 ms | 256 KB |
s2.txt | WA | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |