# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
148781 | | 갓띵건 (#200) | HicCup (FXCUP4_hiccup) | C++17 | | 30 ms | 7296 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 <bits/stdc++.h>
using namespace std;
int cnt[1010101];
int HicCup(string s) {
int n = s.size();
int h = 0;
for(int i = 0; i < n; i++) {
if(s[i] == 'H') h++;
if(s[i] == 'C') h--;
if(h < 0) return -1;
}
if(h != 0) return -1;
int H = 0, mini = 0;
for(int i = 0; i < 1010101; i++) cnt[i] = 0;
for(int i = 0; i < n; i++) {
if(s[i] == 'H') H++;
if(s[i] == 'C') H--, cnt[0]++, mini = 0;
if(s[i] == '!' && cnt[mini] > 0) {
cnt[mini]--;
cnt[mini+1]++;
if(cnt[mini] == 0) mini++;
}
}
return mini;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |