#include "hiccup.h"
#include <bits/stdc++.h>
using namespace std;
int N;
int myS[1000010];
int HicCup(std::string S) {
N = S.size();
stack <int> ST;
for (int i = 0; i < N; i++)
{
if (S[i] == 'H') ST.push(i);
if (S[i] == 'C')
{
if (ST.empty()) return -1;
myS[ST.top()] = i;
ST.pop();
}
}
if (!ST.empty()) return -1;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
6 ms |
384 KB |
Output is correct |
4 |
Correct |
7 ms |
640 KB |
Output is correct |
5 |
Correct |
25 ms |
7296 KB |
Output is correct |
6 |
Correct |
13 ms |
3328 KB |
Output is correct |
7 |
Correct |
13 ms |
3328 KB |
Output is correct |
8 |
Correct |
25 ms |
7168 KB |
Output is correct |
9 |
Correct |
24 ms |
7168 KB |
Output is correct |
10 |
Correct |
14 ms |
3328 KB |
Output is correct |
11 |
Correct |
6 ms |
384 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
6 ms |
384 KB |
Output is correct |
2 |
Correct |
6 ms |
384 KB |
Output is correct |
3 |
Correct |
6 ms |
384 KB |
Output is correct |
4 |
Correct |
7 ms |
640 KB |
Output is correct |
5 |
Correct |
25 ms |
7296 KB |
Output is correct |
6 |
Correct |
13 ms |
3328 KB |
Output is correct |
7 |
Correct |
13 ms |
3328 KB |
Output is correct |
8 |
Correct |
25 ms |
7168 KB |
Output is correct |
9 |
Correct |
24 ms |
7168 KB |
Output is correct |
10 |
Correct |
14 ms |
3328 KB |
Output is correct |
11 |
Correct |
17 ms |
4096 KB |
Output is correct |
12 |
Correct |
15 ms |
4784 KB |
Output is correct |
13 |
Correct |
13 ms |
3584 KB |
Output is correct |
14 |
Correct |
5 ms |
384 KB |
Output is correct |
15 |
Incorrect |
17 ms |
7168 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |