Submission #1533598
Source Code Expand
#include<iostream> #include<iomanip> #include<math.h> #include<vector> #include<algorithm> #include<set> #include<map> #include<queue> #include<stack> #include<string> #include<complex> #include<unordered_map> #define INF 1000000000ll #define MOD 1000000007ll #define EPS 1e-8 #define REP(i, m) for(long long i = 0; i < m; ++i) #define FOR(i, n, m) for(long long i = n; i < m; ++i) #define ALL(v) v.begin(), v.end() #define pb push_back using namespace std; typedef long long ll; typedef pair<ll, ll> P; typedef long double ld; int main() { int n,a,b; cin>>n>>a>>b; string s; cin>>s; int c=0; int ca=0; REP(i,n) { if(s[i]=='a') { if(c<=a+b) { ++c; cout<<"Yes"<<endl; } else { cout<<"No"<<endl; } } if(s[i]=='b') { if(c<=a+b&&ca<b) { ++c; ++ca; cout<<"Yes"<<endl; } else { cout<<"No"<<endl; } } } }
Submission Info
Submission Time | |
---|---|
Task | B - Qualification simulator |
User | gazelle |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 918 Byte |
Status | WA |
Exec Time | 157 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 | 105 ms | 640 KB |
02.txt | WA | 105 ms | 640 KB |
03.txt | WA | 108 ms | 768 KB |
04.txt | WA | 109 ms | 768 KB |
05.txt | WA | 95 ms | 640 KB |
06.txt | WA | 104 ms | 640 KB |
07.txt | AC | 157 ms | 896 KB |
08.txt | AC | 155 ms | 896 KB |
09.txt | WA | 155 ms | 768 KB |
10.txt | AC | 154 ms | 768 KB |
s1.txt | WA | 1 ms | 256 KB |
s2.txt | WA | 1 ms | 256 KB |
s3.txt | WA | 1 ms | 256 KB |