#include "hiccup.h"
using namespace std;
int cnt;
int HicCup(string S) {
int N = S.size();
for(int i=0; i<N; i++){
if(S[i]=='H'){
cnt++;
}else{
if(cnt==0){
return -1;
}
cnt--;
}
}
if(cnt==0){
return 0;
}
return -1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
128 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 |
20 ms |
3328 KB |
Output is correct |
6 |
Correct |
14 ms |
3200 KB |
Output is correct |
7 |
Correct |
14 ms |
3328 KB |
Output is correct |
8 |
Correct |
19 ms |
3328 KB |
Output is correct |
9 |
Correct |
19 ms |
3328 KB |
Output is correct |
10 |
Correct |
13 ms |
3328 KB |
Output is correct |
11 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
128 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 |
20 ms |
3328 KB |
Output is correct |
6 |
Correct |
14 ms |
3200 KB |
Output is correct |
7 |
Correct |
14 ms |
3328 KB |
Output is correct |
8 |
Correct |
19 ms |
3328 KB |
Output is correct |
9 |
Correct |
19 ms |
3328 KB |
Output is correct |
10 |
Correct |
13 ms |
3328 KB |
Output is correct |
11 |
Correct |
13 ms |
3208 KB |
Output is correct |
12 |
Correct |
13 ms |
3072 KB |
Output is correct |
13 |
Correct |
13 ms |
3328 KB |
Output is correct |
14 |
Correct |
5 ms |
128 KB |
Output is correct |
15 |
Correct |
14 ms |
3328 KB |
Output is correct |
16 |
Correct |
5 ms |
128 KB |
Output is correct |
17 |
Correct |
6 ms |
384 KB |
Output is correct |
18 |
Correct |
6 ms |
640 KB |
Output is correct |
19 |
Incorrect |
14 ms |
3328 KB |
Output isn't correct |
20 |
Halted |
0 ms |
0 KB |
- |