# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151589 | leduykhongngu | HicCup (FXCUP4_hiccup) | C++17 | 37 ms | 15208 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 <cstdio>
#include <iostream>
#include <cstring>
#include <stack>
#include <cassert>
#include <vector>
#include <algorithm>
using namespace std;
string S = "";
int n;
int pre[1000005], sum[1000005];
vector<int> End;
bool Check(int lim)
{
int last = S.length() - 1;
int cnt = 0;
for (int R : End) {
cnt += sum[last] - sum[R - 1];
if (cnt < lim) return false;
cnt -= lim;
last = R;
}
return true;
}
int HicCup(std::string tmp)
{
S = tmp;
stack<int> st;
for (int i = 0; i < tmp.length(); ++i) {
sum[i] = sum[i-1];
if (S[i] == '!') {
if (i > 0 && S[i-1] == 'H') return -1;
++sum[i];
continue;
}
if (S[i] == 'H') {
st.push(i);
}
else {
assert(S[i] == 'C');
if (st.size() == 0) return -1;
int L = st.top();
pre[i] = L;
st.pop();
End.push_back(i);
}
}
if (st.size()) return -1;
reverse(End.begin(), End.end());
int lef = 0, rig = S.length(), ans = -1;
while (lef <= rig)
{
int mid = (lef + rig)/2;
if (Check(mid))
{
ans = max(ans, mid);
lef = mid + 1;
}
else rig = mid - 1;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |