Submission #1628725
Source Code Expand
#include <bits/stdc++.h> #define rep(i, a, n) for(int i = a; i < n; i++) #define REP(i, n) rep(i, 0, n) #define repb(i, a, b) for(int i = a; i >= b; i--) #define all(a) a.begin(), a.end() #define int long long #define chmax(x, y) x = max(x, y) #define chmin(x, y) x = min(x, y) using namespace std; typedef pair<int, int> P; const int mod = 1000000007; const int INF = 1e12; signed main(){ ios::sync_with_stdio(false); cin.tie(0); int now = 0, ov = 0; int n, a, b; cin >> n >> a >> b; string s; cin >> s; rep(i, 0, s.size()){ if(s[i] == 'a'){ now++; cout << (now <= (a + b) ? "Yes" : "No") << endl; } if(s[i] == 'b'){ ov++; if(ov <= b){ now++; } cout << ((now <= (a + b) && ov <= b) ? "Yes" : "No") << endl; } if(s[i] == 'c'){ cout << "No" << endl; } } }
Submission Info
Submission Time | |
---|---|
Task | B - Qualification simulator |
User | treeone |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 976 Byte |
Status | AC |
Exec Time | 148 ms |
Memory | 848 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 | 146 ms | 720 KB |
02.txt | AC | 145 ms | 848 KB |
03.txt | AC | 148 ms | 848 KB |
04.txt | AC | 148 ms | 848 KB |
05.txt | AC | 130 ms | 640 KB |
06.txt | AC | 144 ms | 720 KB |
07.txt | AC | 144 ms | 848 KB |
08.txt | AC | 146 ms | 848 KB |
09.txt | AC | 144 ms | 848 KB |
10.txt | AC | 144 ms | 848 KB |
s1.txt | AC | 1 ms | 256 KB |
s2.txt | AC | 1 ms | 256 KB |
s3.txt | AC | 1 ms | 256 KB |