Submission #613316

#	Time	Username	Problem	Language	Result	Execution time	Memory
613316		czhang2718	HicCup (FXCUP4_hiccup)	C++17	24 / 100	76 ms	34868 KiB

hiccup

// #include "hiccup.h"
using namespace std;
#include "bits/stdc++.h"

const int N=1e6+1;
vector<int> adj[N];
int cnt[N];
int X, nodes, ans;
bool bad;

void dfs(int x, int &c){
	c+=cnt[x];
	if(x) nodes++, ans=min(ans, c/nodes);
	// if(X==2) cout << x << " c " << c << "\n";
	for(int i=adj[x].size()-1; i>=0; i--){
		int k=adj[x][i];
		dfs(k, c);
	}
}

int HicCup(std::string S) {
	int n = S.size();
	ans=1e9;
	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]++;
			continue;
		}
		if(S[i]=='C'){
			if(par.size()<2) return -1;
			int p=par.top(); par.pop();
			prv=p;
			adj[par.top()].push_back(p);
		}
		else{
			par.push(i);
		}
	}
	// for(int i=0; i<=n; i++){
	// 	if(cnt[i]) cout << "cnt[" << i << "] " << cnt[i] << "\n";
	// }
	if(par.size()!=1) return -1;

	int c=0;
	dfs(0, c);
	return ans;
}

// int main(){
// 	string s;
// 	cin >> s;
// 	cout << HicCup(s);
// }

• Subtask 1: 24 / 24
• Subtask 2: 0 / 76