#include "hiccup.h"
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
using namespace std;
int HicCup(std::string S) {
int N = S.size();
int mask = 0;
int bal = 0;
for(int i=0; i<N; i++){
if(S[i] == '!' && mask != 3) return -1;
if(S[i] == 'H') bal++, mask |= 1;
if(S[i] == 'C') bal--, mask |= 2;
if(bal < 0) return -1;
}
if(bal > 0) return -1;
int l=1, r=N, res=0;
while(l<=r){
int mid=(l+r)/2;
stack<int> st;
for(int i=0; i<N; i++){
if(S[i] == 'C'){
st.push(0);
} else if(S[i] == '!'){
if(st.size()){
int x = st.top();
st.pop();
x++;
if(x < mid){
st.push(x);
}
}
}
}
if(st.empty()) res = mid, l = mid+1;
else r = mid-1;
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 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 |
9 ms |
512 KB |
Output is correct |
5 |
Correct |
169 ms |
5440 KB |
Output is correct |
6 |
Correct |
12 ms |
3328 KB |
Output is correct |
7 |
Correct |
12 ms |
3456 KB |
Output is correct |
8 |
Correct |
166 ms |
5460 KB |
Output is correct |
9 |
Correct |
169 ms |
5428 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 |
5 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 |
9 ms |
512 KB |
Output is correct |
5 |
Correct |
169 ms |
5440 KB |
Output is correct |
6 |
Correct |
12 ms |
3328 KB |
Output is correct |
7 |
Correct |
12 ms |
3456 KB |
Output is correct |
8 |
Correct |
166 ms |
5460 KB |
Output is correct |
9 |
Correct |
169 ms |
5428 KB |
Output is correct |
10 |
Correct |
14 ms |
3328 KB |
Output is correct |
11 |
Correct |
14 ms |
3288 KB |
Output is correct |
12 |
Correct |
13 ms |
3328 KB |
Output is correct |
13 |
Correct |
13 ms |
3328 KB |
Output is correct |
14 |
Correct |
5 ms |
384 KB |
Output is correct |
15 |
Incorrect |
97 ms |
3376 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |