# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
149824 | | (대충 적당한 팀명) (#200) | HicCup (FXCUP4_hiccup) | C++17 | | 24 ms | 3328 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 set = 0;
std::vector<char> arr;
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++;
count++;
}
i--;
continue;
}
else if (arr.back() == 'H' && S[i] == '!') {
std::cout << "���";
return -1;
}
else if (arr.back() == 'H' && S[i] == 'H') {
arr.push_back('H');
}
}
else {
if (S[i] == 'C') {
return -1;
}
else if (S[i] == 'H') {
arr.push_back('H');
}
}
if (S[i] == '!' && set == 0) {
return -1;
}
if (S[i] == '!') {
count++;
}
}
return count / set;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |