Submission #149007

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
149007	2019-09-01T05:32:56 Z	본인 방금 올솔하는 상상함(#3610, gs18113, dennisstar, red1108)	HicCup (FXCUP4_hiccup)	C++17	24 / 100	49 ms	14848 KB

hiccup

#include "hiccup.h"
#include<bits/stdc++.h>
#define N 1000005

using namespace std;
typedef pair<int,int> pi;

int cnt[N];
int ch[N];
int nxt[N];
int asdf[N];

int HicCup(std::string S) {
	int n = S.size();
	stack<pi> st;
	stack<pi> st2;
	int lv=0;
	int last=0;
	for(int i=0;i<n;i++){
		if(S[i]=='H'){
			lv++;
			st.push(pi(i, lv));
			st2.push(pi(i, lv));
		}
		else if(S[i]=='C'){
			if(st.empty()) return -1;
			pi t=st.top();
			st.pop();
			while(!st2.empty()&&(st2.top().second>lv||st2.top()==t)){
				st2.pop();
			}
			if(!st2.empty()) {
				nxt[st2.top().first]=t.first+1;
			}
			st2.push(t);
			lv--;
		}
		else{
			if(st2.empty()||lv==st2.top().second) return -1;
			cnt[st2.top().first]++;
		}
	}
	if(!st.empty()) return -1;
	int sum=0;
	int c=0;
	int ans=INT_MAX;
	for(int i=0;i<n;i++){
		if(ch[i]) continue;
		if(S[i]!='H') continue;
		else{
			sum=0;
			c=0;
			for(int j=i+1;j;j=nxt[j-1]){
				ch[j-1]=1;
				sum+=cnt[j-1];
				c++;
			}
			ans=min(ans, sum/c);
		}
	}
	return ans;
}

Compilation message

hiccup.cpp: In function 'int HicCup(std::__cxx11::string)':
hiccup.cpp:18:6: warning: unused variable 'last' [-Wunused-variable]
  int last=0;
      ^~~~

Subtask #1

24.0 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	384 KB	Output is correct
2	Correct	5 ms	128 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	7 ms	640 KB	Output is correct
5	Correct	48 ms	11128 KB	Output is correct
6	Correct	13 ms	3328 KB	Output is correct
7	Correct	12 ms	3328 KB	Output is correct
8	Correct	47 ms	11128 KB	Output is correct
9	Correct	49 ms	11128 KB	Output is correct
10	Correct	12 ms	3328 KB	Output is correct
11	Correct	5 ms	384 KB	Output is correct

Subtask #2

0 / 76.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	384 KB	Output is correct
2	Correct	5 ms	128 KB	Output is correct
3	Correct	5 ms	384 KB	Output is correct
4	Correct	7 ms	640 KB	Output is correct
5	Correct	48 ms	11128 KB	Output is correct
6	Correct	13 ms	3328 KB	Output is correct
7	Correct	12 ms	3328 KB	Output is correct
8	Correct	47 ms	11128 KB	Output is correct
9	Correct	49 ms	11128 KB	Output is correct
10	Correct	12 ms	3328 KB	Output is correct
11	Correct	16 ms	4864 KB	Output is correct
12	Correct	18 ms	6272 KB	Output is correct
13	Correct	13 ms	3712 KB	Output is correct
14	Correct	6 ms	384 KB	Output is correct
15	Correct	13 ms	3456 KB	Output is correct
16	Correct	5 ms	384 KB	Output is correct
17	Correct	6 ms	384 KB	Output is correct
18	Correct	7 ms	640 KB	Output is correct
19	Incorrect	24 ms	14848 KB	Output isn't correct
20	Halted	0 ms	0 KB	-