oj.uz

답안 #150229

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
150229 2019-09-01T07:56:31 Z GucciBelt(#3697, PeppaPig, win11905, DodgeBallMan) HicCup (FXCUP4_hiccup) C++17
24 / 100
 233 ms 5448 KB 
#include "hiccup.h"
#include <bits/stdc++.h>

using namespace std;

const int N = 1e6+5;

int n;

int HicCup(string S) {
	n = S.size();
	int cnt = 0;
	bool state = false;
	for(int i = 0; i < n; ++i) {
		if(S[i] == 'H') cnt++, state = false;
		if(S[i] == 'C') if(!~--cnt) return -1; else state = true;
		if(S[i] == '!') if(!state) return -1;	
	}
	if(cnt) return -1;
	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:16:5: warning: suggest explicit braces to avoid ambiguous 'else' [-Wdangling-else]
   if(S[i] == 'C') if(!~--cnt) return -1; else state = true;
     ^
hiccup.cpp:25:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < S.size(); i++) {
                  ~~^~~~~~~~~~

Subtask #1
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 11 ms 512 KB Output is correct
5 Correct 215 ms 5448 KB Output is correct
6 Correct 13 ms 3328 KB Output is correct
7 Correct 13 ms 3328 KB Output is correct
8 Correct 233 ms 5424 KB Output is correct
9 Correct 208 ms 5444 KB Output is correct
10 Correct 12 ms 3328 KB Output is correct
11 Correct 5 ms 384 KB Output is correct

Subtask #2
0 / 76.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 11 ms 512 KB Output is correct
5 Correct 215 ms 5448 KB Output is correct
6 Correct 13 ms 3328 KB Output is correct
7 Correct 13 ms 3328 KB Output is correct
8 Correct 233 ms 5424 KB Output is correct
9 Correct 208 ms 5444 KB Output is correct
10 Correct 12 ms 3328 KB Output is correct
11 Correct 14 ms 3328 KB Output is correct
12 Correct 13 ms 3200 KB Output is correct
13 Correct 14 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 5 ms 384 KB Output is correct
17 Correct 5 ms 384 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 137 ms 3328 KB Output is correct
20 Incorrect 144 ms 3328 KB Output isn't correct
21 Halted 0 ms 0 KB -