# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
149490 | 2019-09-01T06:35:56 Z | 준표야 함수컵은 캐리해줄거지?(#3588, Acka, spectaclehong, heiler) | HicCup (FXCUP4_hiccup) | C++17 | 213 ms | 7216 KB |
#include "hiccup.h" #include <cstdio> #include <algorithm> using namespace std; int st[1000006] = {-1}; int top; bool chk(string &S, int k) { top = 0; for (int i = 0; i < S.size(); i++) { if (S[i] == 'H') { st[++top] = -1; } else if (S[i] == 'C') { st[++top] = -2; } else if (S[i] == '!') { if (st[top] < 0) st[++top] = 1; else st[top]++; if (st[top - 1] == -1) top--; } if (k) while (top > 2 && st[top - 2] == -1 && st[top - 1] == -2 && st[top] >= k) { st[top - 2] = st[top] - k; top -= 2; while (st[top - 1] >= 0) { st[top - 1] += st[top]; top--; } while (st[top] == 0) top--; } else { while (st[top] >= 0) top--; while (top > 1 && st[top - 1] == -1 && st[top] == -2) { top -= 2; while (st[top] >= 0) top--; } } } return !top; } int HicCup(std::string S) { int s = 0; if (S[0] != 'H') return -1; int max_level = 0; for (int i = 0; i < S.size(); i++) { if (S[i] == 'H') s++; else if (S[i] == 'C') s--; if (s < 0) return -1; max_level = max(max_level, s); } if (s) return -1; for (int i = 0; i < S.size(); i++) { if (S[i] == 'H') s++; else if (S[i] == 'C') s--; if (s < 0) return -1; if (S[i] == '!' && s == max_level) return -1; } int l = 0, r = S.size(); while (l + 1 < r) { int mid = l + r >> 1; if (!chk(S, mid)) r = mid; else l = mid; } return l; } // int main() { // int ret = HicCup("HHCHC!!!!!C"); // printf("%d\n", ret); // }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 6 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 12 ms | 384 KB | Output is correct |
5 | Correct | 208 ms | 7216 KB | Output is correct |
6 | Correct | 12 ms | 3328 KB | Output is correct |
7 | Correct | 13 ms | 3328 KB | Output is correct |
8 | Correct | 201 ms | 7160 KB | Output is correct |
9 | Correct | 213 ms | 7168 KB | Output is correct |
10 | Correct | 13 ms | 3328 KB | Output is correct |
11 | Correct | 6 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 384 KB | Output is correct |
2 | Correct | 6 ms | 384 KB | Output is correct |
3 | Correct | 5 ms | 384 KB | Output is correct |
4 | Correct | 12 ms | 384 KB | Output is correct |
5 | Correct | 208 ms | 7216 KB | Output is correct |
6 | Correct | 12 ms | 3328 KB | Output is correct |
7 | Correct | 13 ms | 3328 KB | Output is correct |
8 | Correct | 201 ms | 7160 KB | Output is correct |
9 | Correct | 213 ms | 7168 KB | Output is correct |
10 | Correct | 13 ms | 3328 KB | Output is correct |
11 | Correct | 15 ms | 3328 KB | Output is correct |
12 | Correct | 21 ms | 3328 KB | Output is correct |
13 | Correct | 13 ms | 3328 KB | Output is correct |
14 | Correct | 6 ms | 384 KB | Output is correct |
15 | Incorrect | 107 ms | 3456 KB | Output isn't correct |
16 | Halted | 0 ms | 0 KB | - |