oj.uz

Submission #148579

# Submission time Handle Problem Language Result Execution time Memory
148579 2019-09-01T04:42:14 Z 채원♡예나(#3706, rhrnald, ohjw420, chris2tg) HicCup (FXCUP4_hiccup) C++17
24 / 100
 28 ms 3328 KB 
#include "hiccup.h"
#include <cstdio>
#include <iostream>
#include <string>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<stack>
#include<map>

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<ll, ll> pll;

const int INF = 1e9 + 7;
const int MAX = 4005;

int HicCup(std::string s) {
	int size = s.size();
	int min = INF;
	int cur = 0;
	int cnt = 0;
	int hc = 0;
	for (int i = size - 1; i >= 0; i--) {
		if (s[i] == '!') cnt++;
		if (s[i] == 'H') {
			if (hc > 0) hc--;
			else return -1;
		}
		if (s[i] == 'C') {
			hc++;
			cur++;
			if (min > cnt / cur) min = cnt / cur;
		}
	}
	if (hc != 0) return -1;
	bool check = false;
	int ck = 0;
	for (int i = 0; i < size; i++) {
		if (s[i] == '!') break;
		if (s[i] == 'C') {
			if (ck == 0) break;
			check = true;
			break;
		}
		if (s[i] == 'H') ck = 1;
	}
	for (int i = 0; i < size - 1; i++) {
		if (s[i] == 'H' && s[i + 1] == '!') {
			check = false;
			break;
		}
	}
	if (!check) return -1;
	return min;
}

Subtask #1
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 128 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 26 ms 3328 KB Output is correct
6 Correct 13 ms 3328 KB Output is correct
7 Correct 13 ms 3328 KB Output is correct
8 Correct 27 ms 3328 KB Output is correct
9 Correct 28 ms 3328 KB Output is correct
10 Correct 13 ms 3328 KB Output is correct
11 Correct 5 ms 384 KB Output is correct

Subtask #2
0 / 76.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 128 KB Output is correct
2 Correct 6 ms 384 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 26 ms 3328 KB Output is correct
6 Correct 13 ms 3328 KB Output is correct
7 Correct 13 ms 3328 KB Output is correct
8 Correct 27 ms 3328 KB Output is correct
9 Correct 28 ms 3328 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 15 ms 3328 KB Output is correct
14 Correct 6 ms 384 KB Output is correct
15 Correct 16 ms 3328 KB Output is correct
16 Correct 6 ms 384 KB Output is correct
17 Correct 6 ms 384 KB Output is correct
18 Correct 6 ms 640 KB Output is correct
19 Correct 16 ms 3328 KB Output is correct
20 Incorrect 16 ms 3328 KB Output isn't correct
21 Halted 0 ms 0 KB -