# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
613040 | penguinhacker | 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"
#include <bits/stdc++.h>
using namespace std;
const int mxN=1e6+2;
int n=1, cnt[mxN];
stack<int> stk;
vector<int> adj[mxN];
bool dfs(int u, int x) {
for (int v : adj[u])
if (!dfs(v, x))
return 0;
reverse(adj[u].begin(), adj[u].end());
int cur=0;
for (int i=0; i<adj[u].size(); ++i) {
cur+=cnt[adj[u][i]]-x;
if (cur<0)
return 0;
}
reverse(adj[u].begin(), adj[u].end());
return 1;
}
int HicCup(string s) {
stk.push(0);
for (int i=0; i<s.size(); ++i) {
if (s[i]=='H') {
adj[stk.top()].push_back(n2);
stk.push(n2++);