oj.uz

Submission #149610

# Submission time Handle Problem Language Result Execution time Memory
149610 2019-09-01T06:50:04 Z 준표야 함수컵은 캐리해줄거지?(#3588, Acka, spectaclehong, heiler) HicCup (FXCUP4_hiccup) C++17
24 / 100
 211 ms 11136 KB 
#include "hiccup.h"

#include <cstdio>
#include <algorithm>

using namespace std;

int st[1000006] = {-1};
int top;
bool chk(string &S, int k) {
	top = 0;
	for (int i = 0; i < S.size(); i++) {
		if (S[i] == 'H') {
			st[++top] = -1;
		}
		else if (S[i] == 'C') {
			st[++top] = -2;
		}
		else if (S[i] == '!') {
			if (st[top] < 0) st[++top] = 1;
			else st[top]++;
			if (st[top - 1] == -1) top--;
		}
		if (k) while (top > 2 && st[top - 2] == -1 && st[top - 1] == -2 && st[top] >= k) {
			st[top - 2] = st[top] - k;
			top -= 2;
			while (st[top - 1] >= 0) {
				st[top - 1] += st[top];
				top--;
			}
			while (st[top] == 0) top--;
		}
		else {
			while (st[top] >= 0) top--;
			while (top > 1 && st[top - 1] == -1 && st[top] == -2) {
				top -= 2;
				while (st[top] >= 0) top--;
			}
		}
	}
	return !top;
}


int HicCup(std::string S) {
	int st[1000006] = {0};
	int s = 0;
	int top = 0;
	if (S[0] != 'H') return -1;
	for (int i = 0; i < S.size(); i++) {
		if (S[i] == 'H') {
			s++;
			st[top]++;
			st[++top] = 0;
		}
		else if (S[i] == 'C') {
			s--;
			if (st[top] == 0 && S[i - 1] != 'H') return -1;
			top--;
		}
		if (s < 0) return -1;
	}
	if (s) return -1;
	int l = 0, r = S.size();
	while (l + 1 < r) {
		int mid = l + r >> 1;
		if (!chk(S, mid)) r = mid;
		else l = mid;
	}
	return l;
}

// int main() {
// 	int ret = HicCup("HHC!C!");
// 	printf("%d\n", ret);
// }

Compilation message

hiccup.cpp: In function 'bool chk(std::__cxx11::string&, int)':
hiccup.cpp:12:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~
hiccup.cpp: In function 'int HicCup(std::__cxx11::string)':
hiccup.cpp:50:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~
hiccup.cpp:66:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l + r >> 1;
             ~~^~~

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4224 KB Output is correct
2 Correct 8 ms 4224 KB Output is correct
3 Correct 8 ms 4352 KB Output is correct
4 Correct 13 ms 4480 KB Output is correct
5 Correct 207 ms 11128 KB Output is correct
6 Correct 17 ms 7168 KB Output is correct
7 Correct 16 ms 7040 KB Output is correct
8 Correct 208 ms 11136 KB Output is correct
9 Correct 211 ms 11128 KB Output is correct
10 Correct 17 ms 7168 KB Output is correct
11 Correct 7 ms 4352 KB Output is correct

Subtask #2
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 4224 KB Output is correct
2 Correct 8 ms 4224 KB Output is correct
3 Correct 8 ms 4352 KB Output is correct
4 Correct 13 ms 4480 KB Output is correct
5 Correct 207 ms 11128 KB Output is correct
6 Correct 17 ms 7168 KB Output is correct
7 Correct 16 ms 7040 KB Output is correct
8 Correct 208 ms 11136 KB Output is correct
9 Correct 211 ms 11128 KB Output is correct
10 Correct 17 ms 7168 KB Output is correct
11 Correct 17 ms 7296 KB Output is correct
12 Correct 17 ms 7296 KB Output is correct
13 Correct 18 ms 7296 KB Output is correct
14 Correct 8 ms 4352 KB Output is correct
15 Incorrect 107 ms 7296 KB Output isn't correct
16 Halted 0 ms 0 KB -