#include "hiccup.h"
#include <algorithm>
#include <string>
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;
}
int l=1, r=N, res=0;
while(l<=r){
int m = (l+r)/2;
int cur = 0;
int curcur = 0;
for(int i=0; i<N; i++){
if(S[i] == 'C') cur++;
else if(S[i] == '!'){
if(cur){
curcur++;
if(curcur == m){
curcur = 0;
cur--;
}
}
}
}
if(cur) r = m-1;
else l = m+1, res = m;
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
128 KB |
Output is correct |
3 |
Correct |
6 ms |
512 KB |
Output is correct |
4 |
Correct |
9 ms |
512 KB |
Output is correct |
5 |
Correct |
135 ms |
3328 KB |
Output is correct |
6 |
Correct |
16 ms |
3328 KB |
Output is correct |
7 |
Correct |
13 ms |
3328 KB |
Output is correct |
8 |
Correct |
133 ms |
3328 KB |
Output is correct |
9 |
Correct |
134 ms |
3200 KB |
Output is correct |
10 |
Correct |
13 ms |
3328 KB |
Output is correct |
11 |
Incorrect |
5 ms |
256 KB |
Output isn't correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
384 KB |
Output is correct |
2 |
Correct |
5 ms |
128 KB |
Output is correct |
3 |
Correct |
6 ms |
512 KB |
Output is correct |
4 |
Correct |
9 ms |
512 KB |
Output is correct |
5 |
Correct |
135 ms |
3328 KB |
Output is correct |
6 |
Correct |
16 ms |
3328 KB |
Output is correct |
7 |
Correct |
13 ms |
3328 KB |
Output is correct |
8 |
Correct |
133 ms |
3328 KB |
Output is correct |
9 |
Correct |
134 ms |
3200 KB |
Output is correct |
10 |
Correct |
13 ms |
3328 KB |
Output is correct |
11 |
Correct |
14 ms |
3328 KB |
Output is correct |
12 |
Correct |
16 ms |
3200 KB |
Output is correct |
13 |
Correct |
13 ms |
3328 KB |
Output is correct |
14 |
Correct |
6 ms |
384 KB |
Output is correct |
15 |
Incorrect |
47 ms |
3328 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |