#include "hiccup.h"
#include <stack>
int HicCup(std::string S) {
int N = S.size();
int Hcnt = 0;
int res = 0;
for (int i=0; i<N; i++) {
if (S[i] == 'H') {
Hcnt++;
} else if (S[i] == 'C') {
if (Hcnt > 0) {
Hcnt--;
} else {
res = -1;
break;
}
}
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
432 KB |
Output is correct |
4 |
Correct |
6 ms |
512 KB |
Output is correct |
5 |
Correct |
20 ms |
3328 KB |
Output is correct |
6 |
Correct |
13 ms |
3352 KB |
Output is correct |
7 |
Correct |
14 ms |
3328 KB |
Output is correct |
8 |
Correct |
24 ms |
3328 KB |
Output is correct |
9 |
Correct |
20 ms |
3376 KB |
Output is correct |
10 |
Correct |
15 ms |
3328 KB |
Output is correct |
11 |
Incorrect |
5 ms |
384 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
5 ms |
432 KB |
Output is correct |
4 |
Correct |
6 ms |
512 KB |
Output is correct |
5 |
Correct |
20 ms |
3328 KB |
Output is correct |
6 |
Correct |
13 ms |
3352 KB |
Output is correct |
7 |
Correct |
14 ms |
3328 KB |
Output is correct |
8 |
Correct |
24 ms |
3328 KB |
Output is correct |
9 |
Correct |
20 ms |
3376 KB |
Output is correct |
10 |
Correct |
15 ms |
3328 KB |
Output is correct |
11 |
Correct |
14 ms |
3456 KB |
Output is correct |
12 |
Correct |
14 ms |
3200 KB |
Output is correct |
13 |
Correct |
15 ms |
3456 KB |
Output is correct |
14 |
Correct |
5 ms |
384 KB |
Output is correct |
15 |
Incorrect |
14 ms |
3328 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |