#include "hiccup.h"
int HicCup(std::string S) {
int N = S.size();
int st = 0;
for(int i=0;i<N;i++){
if(S[i]=='H') st++;
else if(S[i]=='C') st--;
else{
if(i==0 || S[i-1] == 'H') return -1;
}
if(st<0) return -1;
}
if(st!=0) return -1;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
6 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
512 KB |
Output is correct |
5 |
Correct |
21 ms |
3328 KB |
Output is correct |
6 |
Correct |
14 ms |
3072 KB |
Output is correct |
7 |
Correct |
13 ms |
3328 KB |
Output is correct |
8 |
Correct |
20 ms |
3328 KB |
Output is correct |
9 |
Correct |
20 ms |
3328 KB |
Output is correct |
10 |
Correct |
14 ms |
3328 KB |
Output is correct |
11 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
384 KB |
Output is correct |
3 |
Correct |
6 ms |
384 KB |
Output is correct |
4 |
Correct |
6 ms |
512 KB |
Output is correct |
5 |
Correct |
21 ms |
3328 KB |
Output is correct |
6 |
Correct |
14 ms |
3072 KB |
Output is correct |
7 |
Correct |
13 ms |
3328 KB |
Output is correct |
8 |
Correct |
20 ms |
3328 KB |
Output is correct |
9 |
Correct |
20 ms |
3328 KB |
Output is correct |
10 |
Correct |
14 ms |
3328 KB |
Output is correct |
11 |
Correct |
16 ms |
3328 KB |
Output is correct |
12 |
Correct |
15 ms |
3328 KB |
Output is correct |
13 |
Correct |
16 ms |
3328 KB |
Output is correct |
14 |
Correct |
5 ms |
384 KB |
Output is correct |
15 |
Correct |
14 ms |
3328 KB |
Output is correct |
16 |
Correct |
6 ms |
384 KB |
Output is correct |
17 |
Correct |
5 ms |
384 KB |
Output is correct |
18 |
Correct |
6 ms |
640 KB |
Output is correct |
19 |
Incorrect |
16 ms |
3328 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |