oj.uz

답안 #150968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150968 2019-09-01T13:18:04 Z JustInCase HicCup (FXCUP4_hiccup) C++17
0 / 100
 18 ms 3960 KB 
#include <bits/stdc++.h>

#ifdef LOCAL
	#include "grader.cpp"
#else
	#include "hiccup.h"
#endif

#define hic_cup HicCup



bool check_is_valid_input(const std::string &s) {
	int32_t cntH = 0, cntC = 0;
	for(int32_t i = 0; i < s.size(); i++) {
		if(s[i] == 'H') {
			cntH++;
		}
		else if(s[i] == 'C') {
			cntC++;
		}
		else {
			if(cntH != cntC) {
				return false;
			}
		}

		if(cntC > cntH) {
			return false;
		}
	}

	return true;
}

bool check_is_x_string(const std::string &s, int32_t x) {
	std::stack< int32_t > stH;
	std::stack< std::pair< int32_t, int32_t > > st;
	
	for(int32_t i = 0; i < s.size(); i++) {
		if(s[i] == 'H') {
			stH.push(i);
		}
		else if(s[i] == 'C') {
			if(!st.empty() && st.top().first > stH.top()) {
				return false;
			}

			st.push({stH.top(), x});
			stH.pop();
		}
		else {
			if(!st.empty()) {
				auto aux = st.top();
				st.pop();

				aux.second--;
				if(aux.second != 0) {
					st.push(aux);
				}
			}
		}
	}
	
	if(st.empty()) {
		return true;
	}
	else {
		return false;
	}
}

int32_t hic_cup(std::string s) {
	if(!check_is_valid_input(s)) {
		return -1;
	}

	int32_t low = 1, high = s.size();
	while(low <= high) {
		int32_t mid = (low + high) / 2;

		if(check_is_x_string(s, mid)) {
			low = mid + 1;
		}
		else {
			high = mid - 1;
		}
	}

	return low - 1;
}

Compilation message

hiccup.cpp: In function 'bool check_is_valid_input(const string&)':
hiccup.cpp:15:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int32_t i = 0; i < s.size(); i++) {
                     ~~^~~~~~~~~~
hiccup.cpp: In function 'bool check_is_x_string(const string&, int32_t)':
hiccup.cpp:40:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int32_t i = 0; i < s.size(); i++) {
                     ~~^~~~~~~~~~

Subtask #1
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 18 ms 3832 KB Output is correct
6 Correct 10 ms 3832 KB Output is correct
7 Correct 13 ms 3832 KB Output is correct
8 Correct 17 ms 3960 KB Output is correct
9 Correct 16 ms 3832 KB Output is correct
10 Correct 9 ms 3704 KB Output is correct
11 Incorrect 2 ms 376 KB Output isn't correct

Subtask #2
0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 380 KB Output is correct
4 Correct 3 ms 504 KB Output is correct
5 Correct 18 ms 3832 KB Output is correct
6 Correct 10 ms 3832 KB Output is correct
7 Correct 13 ms 3832 KB Output is correct
8 Correct 17 ms 3960 KB Output is correct
9 Correct 16 ms 3832 KB Output is correct
10 Correct 9 ms 3704 KB Output is correct
11 Correct 9 ms 3832 KB Output is correct
12 Correct 9 ms 3704 KB Output is correct
13 Correct 9 ms 3832 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 9 ms 3832 KB Output is correct
16 Incorrect 2 ms 376 KB Output isn't correct
17 Halted 0 ms 0 KB -