# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
150895 | baikdohyup | HicCup (FXCUP4_hiccup) | C++17 | 331 ms | 5868 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "hiccup.h"
#include <iostream>
#include <vector>
int HicCup(std::string S) {
int N = S.size();
int count = 0;
int subcount = 0;
int min = 0;
int rmin = -1;
int set = 0;
std::vector<char> arr;
std::vector<int> arr2;
for (int i = 0; i < N; i++) {
if (!arr.empty()) {
if (arr.back() == 'H' && S[i] == 'C') {
arr.pop_back();
i++;
set++;
while (S[i] == '!' && i < N) {
i++;
count++;
subcount++;
}
if (i < N && S[i] == 'C') {
if (rmin == -1) {
rmin = subcount;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |