답안 #113901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
113901	2019-05-29T07:19:05 Z	imsifile	HicCup (FXCUP4_hiccup)	C++17	100 / 100	53 ms	3456 KB

hiccup

#include "hiccup.h"
using namespace std;

char ch[1010101];
int am[1010101], scn;

bool isok(int N, string &S, int K){
	scn=0;
	for(int i=0; i<N; i++){
		if(S[i]=='H') ch[scn]='H', am[scn++]=0;
		if(S[i]=='C'){
			while(1){
				if(!scn || ch[scn-1]=='C') return 0;
				scn--;
				if(ch[scn]=='H') break;
				if(ch[scn]=='X' && am[scn]) return 0;
			}
			if(scn && ch[scn-1]=='X') am[scn-1]+=K;
			else ch[scn]='X', am[scn++]=K;
		}
		if(S[i]=='!'){
			if(!scn || ch[scn-1]!='X') return 0;
			am[scn-1]--;
			if(am[scn-1]<0) am[scn-1]=0;
		}
	}
	while(scn){
		scn--;
		if(ch[scn]=='H' || ch[scn]=='C') return 0;
		if(ch[scn]=='X' && am[scn]) return 0;
	}
	return 1;
}

int HicCup(int N, string S) {
	int mi=0, mx=N, md, dap=-1;
	while(mi<=mx){
		md=(mi+mx)/2;
		if(isok(N, S, md)) dap=md, mi=md+1;
		else mx=md-1;
	}
	return dap;
}

Subtask #1

24.0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	428 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	16 ms	3200 KB	Output is correct
6	Correct	7 ms	3200 KB	Output is correct
7	Correct	7 ms	3200 KB	Output is correct
8	Correct	16 ms	3260 KB	Output is correct
9	Correct	15 ms	3312 KB	Output is correct
10	Correct	7 ms	3328 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct

Subtask #2

76.0 / 76.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	428 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	384 KB	Output is correct
5	Correct	16 ms	3200 KB	Output is correct
6	Correct	7 ms	3200 KB	Output is correct
7	Correct	7 ms	3200 KB	Output is correct
8	Correct	16 ms	3260 KB	Output is correct
9	Correct	15 ms	3312 KB	Output is correct
10	Correct	7 ms	3328 KB	Output is correct
11	Correct	9 ms	3328 KB	Output is correct
12	Correct	10 ms	3200 KB	Output is correct
13	Correct	10 ms	3200 KB	Output is correct
14	Correct	2 ms	256 KB	Output is correct
15	Correct	8 ms	3200 KB	Output is correct
16	Correct	2 ms	384 KB	Output is correct
17	Correct	2 ms	384 KB	Output is correct
18	Correct	2 ms	512 KB	Output is correct
19	Correct	24 ms	3200 KB	Output is correct
20	Correct	15 ms	3320 KB	Output is correct
21	Correct	34 ms	3200 KB	Output is correct
22	Correct	35 ms	3168 KB	Output is correct
23	Correct	53 ms	3200 KB	Output is correct
24	Correct	13 ms	3328 KB	Output is correct
25	Correct	15 ms	3200 KB	Output is correct
26	Correct	15 ms	3456 KB	Output is correct
27	Correct	43 ms	3324 KB	Output is correct
28	Correct	52 ms	3232 KB	Output is correct
29	Correct	51 ms	3312 KB	Output is correct
30	Correct	2 ms	384 KB	Output is correct
31	Correct	2 ms	384 KB	Output is correct
32	Correct	4 ms	512 KB	Output is correct
33	Correct	2 ms	256 KB	Output is correct