# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
150565 | 2019-09-01T08:39:00 Z | (대충 적당한 팀명)(#3621, rose0310, cos18, baikdohyup) | HicCup (FXCUP4_hiccup) | C++17 | 28 ms | 5492 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; } } 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 - (arr2.size() - i - 1) * min) { can = 0; break; } } } if (can == 1) { return min; } else { arr2[arr2.size() - 1]--; arr2[arr2.size() - 2]++; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | 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 | 6 ms | 512 KB | Output is correct |
5 | Correct | 26 ms | 5492 KB | Output is correct |
6 | Correct | 13 ms | 3328 KB | Output is correct |
7 | Correct | 13 ms | 3328 KB | Output is correct |
8 | Correct | 27 ms | 5484 KB | Output is correct |
9 | Correct | 28 ms | 5492 KB | Output is correct |
10 | Correct | 12 ms | 3328 KB | Output is correct |
11 | Incorrect | 5 ms | 384 KB | Output isn't 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 | 6 ms | 512 KB | Output is correct |
5 | Correct | 26 ms | 5492 KB | Output is correct |
6 | Correct | 13 ms | 3328 KB | Output is correct |
7 | Correct | 13 ms | 3328 KB | Output is correct |
8 | Correct | 27 ms | 5484 KB | Output is correct |
9 | Correct | 28 ms | 5492 KB | Output is correct |
10 | Correct | 12 ms | 3328 KB | Output is correct |
11 | Correct | 15 ms | 3964 KB | Output is correct |
12 | Correct | 14 ms | 3672 KB | Output is correct |
13 | Correct | 13 ms | 3328 KB | Output is correct |
14 | Correct | 5 ms | 384 KB | Output is correct |
15 | Correct | 13 ms | 3328 KB | Output is correct |
16 | Correct | 6 ms | 384 KB | Output is correct |
17 | Correct | 5 ms | 128 KB | Output is correct |
18 | Correct | 6 ms | 640 KB | Output is correct |
19 | Correct | 14 ms | 3328 KB | Output is correct |
20 | Incorrect | 13 ms | 3456 KB | Output isn't correct |
21 | Halted | 0 ms | 0 KB | - |