oj.uz

답안 #149335

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
149335 2019-09-01T06:16:26 Z 갓띵건(#3694, gs18103, sjimed, gs18065) HicCup (FXCUP4_hiccup) C++17
24 / 100
 21 ms 3328 KB 
#include "hiccup.h"
#include <bits/stdc++.h>

using namespace std;

int HicCup(string s) {
	int n = s.size();
	int h = 0, hc = 0;
	bool flag = false, flag2 = false;
	for(int i = 0; i < n; i++) {
		if(s[i] == 'H') {
			flag2 = true;
			h++;
			flag = false;
		}
		if(s[i] == 'C') {
			h--;
			hc++;
			flag = false;
			flag2 = false;
		}
		if(s[i] == '!' && !flag) {
			if(hc == 0) return -1;
			if(flag2) return -1;
			hc--;
			flag = true;
		}
		if(h < 0) return -1;
	}
	if(h != 0) return -1;
	
	int lb = 0, ub = 1000000;
	while(lb < ub) {
		int m = (lb + ub + 1) / 2;
		vector <int> v;
		for(int i = 0; i < n; i++) {
			if(s[i] == '!' && !v.empty()) {
				v[v.size()-1]++;
				while(v[v.size()-1] < m && i < n - 1 && s[i+1] == '!') {
					i++, v[v.size()-1]++;
				}
				if(v[v.size()-1] == m) v.pop_back();
				continue;
			}
			else if(!v.empty()) {
				if(v[v.size()-1] < m) break;
				v.pop_back();
			}
			if(s[i] == 'C') v.push_back(0);
		}
		if(v.empty()) lb = m;
		else ub = m-1;
	}
	return lb;
}

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 21 ms 3328 KB Output is correct
6 Correct 14 ms 3328 KB Output is correct
7 Correct 14 ms 3328 KB Output is correct
8 Correct 19 ms 3200 KB Output is correct
9 Correct 19 ms 3328 KB Output is correct
10 Correct 13 ms 3328 KB Output is correct
11 Correct 5 ms 432 KB Output is correct

Subtask #2
0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 21 ms 3328 KB Output is correct
6 Correct 14 ms 3328 KB Output is correct
7 Correct 14 ms 3328 KB Output is correct
8 Correct 19 ms 3200 KB Output is correct
9 Correct 19 ms 3328 KB Output is correct
10 Correct 13 ms 3328 KB Output is correct
11 Correct 15 ms 3328 KB Output is correct
12 Correct 14 ms 3200 KB Output is correct
13 Correct 13 ms 3328 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 12 ms 3328 KB Output is correct
16 Correct 6 ms 256 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Incorrect 16 ms 3328 KB Output isn't correct
20 Halted 0 ms 0 KB -