# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
148485 | | 잉여로운 고3 (#200) | HicCup (FXCUP4_hiccup) | C++17 | | 27 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 <bits/stdc++.h>
#include "hiccup.h"
using namespace std;
int n;
int HicCup(string S)
{
int i, s, a, b, x, ret;
n = S.size();
s = 0;
for(i=0; i<n; i++){
if(S[i] == 'H') s ++;
else if(S[i] == 'C') s --;
if(s < 0) return -1;
}
if(s != 0) return -1;
ret = 1e9;
a = b = x = 0;
for(i=n-1; i>=0; i--){
if(S[i] == '!') a ++, x ++;
else if(S[i] == 'C'){
b ++; x = 0;
ret = min(ret, a / b);
}
}
if(x != 0) return -1;
return ret;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |