#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;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
7 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 |
15 ms |
3328 KB |
Output is correct |
8 |
Correct |
27 ms |
3328 KB |
Output is correct |
9 |
Correct |
25 ms |
3200 KB |
Output is correct |
10 |
Correct |
13 ms |
3328 KB |
Output is correct |
11 |
Correct |
6 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
384 KB |
Output is correct |
4 |
Correct |
7 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 |
15 ms |
3328 KB |
Output is correct |
8 |
Correct |
27 ms |
3328 KB |
Output is correct |
9 |
Correct |
25 ms |
3200 KB |
Output is correct |
10 |
Correct |
13 ms |
3328 KB |
Output is correct |
11 |
Correct |
18 ms |
3328 KB |
Output is correct |
12 |
Correct |
14 ms |
3328 KB |
Output is correct |
13 |
Correct |
13 ms |
3328 KB |
Output is correct |
14 |
Correct |
6 ms |
384 KB |
Output is correct |
15 |
Incorrect |
14 ms |
3328 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |