# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
150115 | 이 대회 미분 되나요? (#200) | HicCup (FXCUP4_hiccup) | C++17 | 85 ms | 8192 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<string>
#include<vector>
#include<algorithm>
using namespace std;
int N;
string s;
int lv[1000101];
bool f(int K)
{
vector<pair<int, int> > v;
for (int i = 0; i < s.size(); i++)
{
if (s[i] == 'C')
{
while (!v.empty() && v.back().first > lv[i])
return false;
v.push_back({ lv[i], 0 });
while (!v.empty() && v.back().second >= K) v.pop_back();
}
else if (s[i] == '!')
{
if (!v.empty()) v.back().second++;
while (!v.empty() && v.back().second >= K) v.pop_back();
}
}
while (!v.empty())
{
if (v.back().second < K) return false;
v.pop_back();
}
return true;
}
int HicCup(std::string S) {
vector<int> v;
N = S.size();
s = S;
int cnt = 0;
for (int i = 0; i < N; i++)
{
if (S[i] == 'H')
{
v.push_back(cnt);
cnt++;
}
else if (S[i] == 'C')
{
if (!v.empty())
{
lv[i] = v.back();
v.pop_back();
}
cnt--;
}
else
{
if (i == 0 || S[i - 1] == 'H') return -1;
}
if (cnt < 0) return -1;
}
if (cnt > 0) return -1;
int lo = 0, hi = 1000001;
for (int i = 0; i < 21; i++)
{
int mid = lo + hi >> 1;
if (f(mid)) lo = mid;
else hi = mid;
}
return lo;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |