oj.uz

Submission #150037

# Submission time Handle Problem Language Result Execution time Memory
150037 2019-09-01T07:35:55 Z GucciBelt(#3697, PeppaPig, win11905, DodgeBallMan) HicCup (FXCUP4_hiccup) C++17
0 / 100
 216 ms 5448 KB 
#include "hiccup.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 1e6+5;

int HicCup(string S) {
	stack<int> stk;
	for(int i = 0; i < S.size(); i++) {
		if(S[i] == 'H') stk.emplace(i);
		else if(S[i] == 'C') {
			if(stk.empty()) return -1;
			else stk.pop();
		}
	}
	int l = 0, r = S.size();
	while(l < r) {
		int mid = (l + r + 1) >> 1;
		queue<int> Q;
		bool chk = false;
		for(int i = 0; i < S.size(); i++) {
			if(S[i] == 'C') {
				chk = true;
				Q.emplace(0);
			} else if(S[i] == '!') {
				if(Q.empty() && !chk) return -1;
				else if(!Q.empty()) {
					int now = Q.front(); Q.pop();
					if(now + 1 < mid) Q.emplace(now + 1);
				}
			}
		}
		if(Q.empty()) l = mid;
		else r = mid - 1;
	}	
	return l;
}

Compilation message

hiccup.cpp: In function 'int HicCup(std::__cxx11::string)':
hiccup.cpp:10:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < S.size(); i++) {
                 ~~^~~~~~~~~~
hiccup.cpp:22:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~

Subtask #1
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 11 ms 512 KB Output is correct
5 Correct 213 ms 5440 KB Output is correct
6 Correct 13 ms 3332 KB Output is correct
7 Correct 14 ms 3328 KB Output is correct
8 Correct 216 ms 5448 KB Output is correct
9 Correct 215 ms 5424 KB Output is correct
10 Correct 13 ms 3328 KB Output is correct
11 Incorrect 6 ms 384 KB Output isn't correct

Subtask #2
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 384 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 6 ms 384 KB Output is correct
4 Correct 11 ms 512 KB Output is correct
5 Correct 213 ms 5440 KB Output is correct
6 Correct 13 ms 3332 KB Output is correct
7 Correct 14 ms 3328 KB Output is correct
8 Correct 216 ms 5448 KB Output is correct
9 Correct 215 ms 5424 KB Output is correct
10 Correct 13 ms 3328 KB Output is correct
11 Correct 14 ms 3328 KB Output is correct
12 Correct 13 ms 3328 KB Output is correct
13 Correct 13 ms 3328 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Incorrect 133 ms 3328 KB Output isn't correct
16 Halted 0 ms 0 KB -