#include "hiccup.h"
#include <bits/stdc++.h>
using namespace std;
int HicCup(string s) {
int n = s.size();
int h = 0;
for(int i = 0; i < n; i++) {
if(s[i] == 'H') h++;
if(s[i] == 'C') h--;
if(h < 0) return -1;
}
if(h != 0) return -1;
int lb = 0, ub = 1000000;
while(lb < ub) {
int m = (lb + ub + 1) / 2;
vector <int> v;
for(int i = 0; i < n; i++) {
if(s[i] == '!' && !v.empty()) v[v.size()-1]++;
if(s[i] == 'C') v.push_back(0);
while(!v.empty() && v[v.size()-1] >= m) v.pop_back();
}
if(v.empty()) lb = m;
else ub = m-1;
}
return lb;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 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 |
12 ms |
772 KB |
Output is correct |
5 |
Correct |
214 ms |
7372 KB |
Output is correct |
6 |
Correct |
14 ms |
3328 KB |
Output is correct |
7 |
Correct |
14 ms |
3200 KB |
Output is correct |
8 |
Correct |
217 ms |
7368 KB |
Output is correct |
9 |
Correct |
211 ms |
7420 KB |
Output is correct |
10 |
Correct |
14 ms |
3328 KB |
Output is correct |
11 |
Correct |
5 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 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 |
12 ms |
772 KB |
Output is correct |
5 |
Correct |
214 ms |
7372 KB |
Output is correct |
6 |
Correct |
14 ms |
3328 KB |
Output is correct |
7 |
Correct |
14 ms |
3200 KB |
Output is correct |
8 |
Correct |
217 ms |
7368 KB |
Output is correct |
9 |
Correct |
211 ms |
7420 KB |
Output is correct |
10 |
Correct |
14 ms |
3328 KB |
Output is correct |
11 |
Correct |
15 ms |
3328 KB |
Output is correct |
12 |
Correct |
14 ms |
3328 KB |
Output is correct |
13 |
Correct |
14 ms |
3328 KB |
Output is correct |
14 |
Correct |
6 ms |
384 KB |
Output is correct |
15 |
Incorrect |
98 ms |
3456 KB |
Output isn't correct |
16 |
Halted |
0 ms |
0 KB |
- |