# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
613211 | czhang2718 | HicCup (FXCUP4_hiccup) | C++17 | 0 ms | 0 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"
using namespace std;
#include "bits/stdc++.h"
const int N=1e6+1;
vector<int> adj[N];
int cnt[N];
int X;
bool bad;
void dfs(int x, int &c){
c+=cnt[x];
for(int i=adj[x].size()-1; i>=0; i--){
int k=adj[x][i];
dfs(k, c);
}
// cout << x << " have " << c << "\n";
c-=X;
if(x && c<0) bad=1;
}
int HicCup(std::string S) {
int n = S.size();
S='-'+S;
stack<int> par;
par.push(0);
int prv=-1;
for(int i=1; i<=n; i++){
if(S[i]=='!'){
if(prv==-1) return -1;
cnt[prv]++;
// cout << "cnt[" << prv << "]++\n";
continue;
}
if(S[i]=='C'){
if(par.size()<2) return -1;
int p=par.top(); par.pop();
adj[par.top()].push_back(p);
// cout << "par " << p << " = " << par.top() << "\n";
prv=p;
}
else{
par.push(i);
}
}
auto check=[&](int x){
X=x;
bad=0;
int c=0;
dfs(0, c);
return !bad;
};
int x=0;
for(int i=19; i>=0; i--){
if(x+(1<<i)<n && check(x+(1<<i))) x+=(1<<i);
}
// check(2);
if(!check(x)) return -1;
return x;
}
int main(){
string s;
cin >> s;
cout << HicCup(s);
}