# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
150397 | 오리버스부릉부릉 (#200) | HicCup (FXCUP4_hiccup) | C++17 | 34 ms | 7536 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "hiccup.h"
#include <stack>
#include <vector>
using namespace std;
vector<int> ss, ww;
int HicCup(std::string S) {
int N = S.size();
int sp, wp;
stack<int> sta;
for (int i = 0; i < N; i++) {
if (S[i] == '!') {
ww.push_back(i);
continue;
}
if (S[i] == 'H') {
sta.push(1);
}
else {
if (sta.empty()) return -1;
else {
sta.pop();
ss.push_back(i);
}
}
}
if (!sta.empty()) return -1;
int ret = 0;
int l = 0, r = 1000000, mid;
int sz = ss.size(), wz = ww.size();
while (l <= r) {
bool suc = true;
mid = (l + r) / 2;
sp = wp = 0;
for (int v : ss) {
while (wp < wz && ww[wp] < v) wp++;
if (wp == wz || ww[wp] < v) {
suc = false; break;
}
int cnt = 0;
while (wp < wz && cnt < mid) {
cnt++;
wp++;
}
if (cnt < mid) {
suc = false; break;
}
}
if (suc) {
ret = mid;
l = mid + 1;
}
else r = mid - 1;
}
return ret;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |