Submission #3247270
Source Code Expand
#include <bits/stdc++.h> const int INF = 1e9; const int MOD = 1e9+7; using LL = long long; const LL LINF = 1e18; const double EPS = 1e-10; using namespace std; #define COUT(v) cout<<(v)<<endl #define CIN(n) int(n);cin >> (n) #define LCIN(n) LL(n);cin >> (n) #define SCIN(n) string(n);cin >> (n) #define YES(n) cout<<((n)? "YES" : "NO")<<endl #define Yes(n) cout<<((n)? "Yes" : "No")<<endl #define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE" ) << endl #define Possible(n) cout << ((n) ? "Possible" : "Impossible" ) <<endl #define FOR(i,a,b) for(int i=(a);i<(b);++i) #define REP(i,n) for(int i=0;i<(n);++i) #define REPR(i,n) for(int i=n;i>=0;i--) #define FOREACH(x,a) for(auto& (x) : (a) ) #define ALL(obj) (obj).begin(),(obj).end() #define P pair<LL,LL> #define I vector<int> #define S set<int> #define pb(v) push_back(v) #define V vector #define rt return #define rmsame(a) sort(ALL(a)),a.erase(unique(ALL(a)), a.end()) typedef string::const_iterator State; class PalseError {}; class Edge{ public: LL from,to,value; Edge(LL a,LL b,LL c){ from = a; to = b; value = c; } Edge(LL a,LL b){ from = a; to = b; } }; int main(){ CIN(N);CIN(A);CIN(B); SCIN(str); int ins = 0; int kai = 1; for(int a = 0;a < str.size();a++){ if(str.at(a) == 'a'){ if(ins < A + B){ ins++; Yes(true); }else{ Yes(false); } }else if(str.at(a) == 'b'){ if(ins < A+B && kai <= B){ Yes(true); ins++; kai++; }else{ Yes(false); } }else{ (Yes(false)); } } return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - Qualification simulator |
User | hamuhei4869 |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 1839 Byte |
Status | AC |
Exec Time | 157 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 | 154 ms | 768 KB |
02.txt | AC | 154 ms | 768 KB |
03.txt | AC | 157 ms | 768 KB |
04.txt | AC | 154 ms | 768 KB |
05.txt | AC | 136 ms | 768 KB |
06.txt | AC | 154 ms | 768 KB |
07.txt | AC | 156 ms | 896 KB |
08.txt | AC | 156 ms | 896 KB |
09.txt | AC | 156 ms | 768 KB |
10.txt | AC | 157 ms | 768 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |