# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
150872 | 2019-09-01T09:50:20 Z | baikdohyup | HicCup (FXCUP4_hiccup) | C++17 | 25 ms | 6384 KB |
#include "hiccup.h" #include <iostream> #include <vector> int HicCup(std::string S) { int N = S.size(); int count = 0; int subcount = 0; int min = 0; int set = 0; std::vector<char> arr; std::vector<int> arr2; for (int i = 0; i < N; i++) { if (!arr.empty()) { if (arr.back() == 'H' && S[i] == 'C') { arr.pop_back(); i++; set++; while (S[i] == '!') { i++; count++; subcount++; } arr2.push_back(subcount); subcount = 0; i--; continue; } else if (arr.back() == 'H' && S[i] == '!') { return -1; } else if (arr.back() == 'H' && S[i] == 'H') { arr.push_back('H'); } } else { if (S[i] == 'C') { return -1; } else if (S[i] == 'H') { arr.push_back('H'); } } if (S[i] == '!' && set == 0) { return -1; } } if (!arr.empty()) { return -1; } int Sum = 0; int sum = 0; for (int i = 0; i < arr2.size(); i++) { sum += arr2[i]; } Sum = sum; while (1) { sum = Sum; min = arr2.back(); int debt = 0; int can = 1; for (int i = 0; i < arr2.size(); i++) { if (arr2[i] > min) { if (debt > 0) { int backup = arr2[i]; while (debt > 0 && backup > min) { debt--; backup--; } sum -= backup; } else { sum -= arr2[i]; } } else if (arr2[i] == min) { sum -= arr2[i]; } else { sum -= arr2[i]; if (min - arr2[i] > sum - ((int)arr2.size() - i - 1) * min) { can = 0; break; } else { sum -= min - arr2[i]; debt += min - arr2[i]; } } } if (can == 1) { return min; } else { arr2[arr2.size() - 1]--; arr2[arr2.size() - 2]++; } } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 3 ms | 760 KB | Output is correct |
5 | Correct | 25 ms | 6384 KB | Output is correct |
6 | Correct | 9 ms | 4344 KB | Output is correct |
7 | Correct | 10 ms | 4216 KB | Output is correct |
8 | Correct | 25 ms | 6380 KB | Output is correct |
9 | Correct | 25 ms | 6380 KB | Output is correct |
10 | Correct | 9 ms | 4220 KB | Output is correct |
11 | Correct | 2 ms | 256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 3 ms | 760 KB | Output is correct |
5 | Correct | 25 ms | 6384 KB | Output is correct |
6 | Correct | 9 ms | 4344 KB | Output is correct |
7 | Correct | 10 ms | 4216 KB | Output is correct |
8 | Correct | 25 ms | 6380 KB | Output is correct |
9 | Correct | 25 ms | 6380 KB | Output is correct |
10 | Correct | 9 ms | 4220 KB | Output is correct |
11 | Correct | 12 ms | 4852 KB | Output is correct |
12 | Correct | 10 ms | 4600 KB | Output is correct |
13 | Correct | 9 ms | 4216 KB | Output is correct |
14 | Correct | 2 ms | 376 KB | Output is correct |
15 | Correct | 9 ms | 4216 KB | Output is correct |
16 | Correct | 2 ms | 376 KB | Output is correct |
17 | Correct | 2 ms | 504 KB | Output is correct |
18 | Correct | 2 ms | 632 KB | Output is correct |
19 | Correct | 10 ms | 4232 KB | Output is correct |
20 | Incorrect | 11 ms | 4372 KB | Output isn't correct |
21 | Halted | 0 ms | 0 KB | - |