| Task: | Tikut |
| Sender: | Username* |
| Submission time: | 2024-11-09 17:20:31 +0200 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 20 |
| group | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | ACCEPTED | 8 |
| #3 | ACCEPTED | 12 |
| #4 | WRONG ANSWER | 0 |
| #5 | WRONG ANSWER | 0 |
| #6 | WRONG ANSWER | 0 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 3, 4, 5, 6 | details |
| #2 | WRONG ANSWER | 0.00 s | 1, 4, 5, 6 | details |
| #3 | WRONG ANSWER | 0.00 s | 1, 4, 5, 6 | details |
| #4 | WRONG ANSWER | 0.00 s | 1, 4, 5, 6 | details |
| #5 | ACCEPTED | 0.00 s | 2, 5, 6 | details |
| #6 | ACCEPTED | 0.00 s | 2, 5, 6 | details |
| #7 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #8 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #9 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #10 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #11 | ACCEPTED | 0.00 s | 3, 5, 6 | details |
| #12 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
| #13 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
| #14 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
| #15 | TIME LIMIT EXCEEDED | -- | 4, 5, 6 | details |
| #16 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #17 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #18 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #19 | TIME LIMIT EXCEEDED | -- | 5, 6 | details |
| #20 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #21 | TIME LIMIT EXCEEDED | -- | 6 | details |
| #22 | TIME LIMIT EXCEEDED | -- | 6 | details |
Code
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <climits>
using namespace std;
void solve(vector<int> sticks, int k, int cutsleft, int& diff) {
if (cutsleft == 0) {
int maxe = *max_element(sticks.begin(), sticks.end());
int mine = *min_element(sticks.begin(), sticks.end());
diff = min(diff, maxe - mine);
return;
}
sort(sticks.begin(), sticks.end());
int longest = sticks.back();
sticks.pop_back();
int half1 = (longest + cutsleft) / (cutsleft + 1);
int half2 = longest - half1;
vector<int> temp1 = sticks;
temp1.push_back(half1);
temp1.push_back(half2);
solve(temp1, k, cutsleft - 1, diff);
half1 = longest / 2;
half2 = longest - half1;
vector<int> temp2 = sticks;
temp2.push_back(half1);
temp2.push_back(half2);
solve(temp2, k, cutsleft - 1, diff);
}
vector<int> solve2(vector<int>& sticks, int m) {
vector<int> results(m, -1);
int c[4] = { 0 };
for (int stick : sticks) {
c[stick]++;
}
for (int k = 1; k <= m; ++k) {
int result = -1;
int cuts = k;
int cur[4];
copy(begin(c), end(c), begin(cur));
if (cur[3] > cuts) {
cuts = 0;
}
else if (cuts > cur[3]) {
cur[2] += cur[3];
cuts -= cur[3];
cur[3] = 0;
}
else if (cuts == cur[3]) {
cur[3] = 0;
cur[2] += cuts;
cuts = 0;
}
if (cuts == cur[2]) {
cur[2] = 0;
cuts = 0;
}
if (cur[3] > 0) {
result = 2;
}
else {
if (cur[2] > 0) {
result = 1;
}
else {
result = 0;
}
}
results[k - 1] = result;
}
return results;
}
int main() {
int n, m;
cin >> n >> m;
vector<int> sticks(n);
for (int i = 0; i < n; ++i) {
cin >> sticks[i];
}
vector<int> results(m, INT_MAX);
if (*max_element(sticks.begin(), sticks.end()) > 3) {
for (int k = 1; k <= m; ++k) {
int min_diff = INT_MAX;
solve(sticks, k, k, min_diff);
results[k - 1] = min_diff;
}
}
else {
results = solve2(sticks, m);
}
for (int result : results) {
cout << result << " ";
}
cout << endl;
return 0;
}
Test details
Test 1
Group: 1, 3, 4, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1 1 6 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 2
Group: 1, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 5 10 4 8 6 2 7 |
| correct output |
|---|
| 5 4 2 2 2 1 1 1 1 1 |
| user output |
|---|
| 5 4 2 2 2 1 1 2 2 1 |
Test 3
Group: 1, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 5 10 5 5 8 6 7 |
| correct output |
|---|
| 3 3 2 3 2 2 1 1 1 2 |
| user output |
|---|
| 3 3 2 3 2 2 2 1 2 2 |
Test 4
Group: 1, 4, 5, 6
Verdict: WRONG ANSWER
| input |
|---|
| 5 10 8 7 9 6 10 |
| correct output |
|---|
| 4 4 3 3 2 2 1 2 2 1 |
| user output |
|---|
| 4 4 3 3 2 3 2 2 2 2 |
Test 5
Group: 2, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 1071 3 2 3 1 3 3 2 3 2 3 2 2 2 1 2 ... |
| correct output |
|---|
| 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
| user output |
|---|
| 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
Test 6
Group: 2, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 1500 3 2 2 3 2 3 2 2 2 3 2 2 3 3 3 ... |
| correct output |
|---|
| 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
| user output |
|---|
| 2 2 2 2 2 2 2 2 2 2 2 2 2 2 2 ... |
Test 7
Group: 3, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2 15 710 210 347 398 66 318 277 ... |
| correct output |
|---|
| 994 994 |
| user output |
|---|
| 994 994 |
Test 8
Group: 3, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2 743 890 592 942 736 969 616 50... |
| correct output |
|---|
| 498 496 |
| user output |
|---|
| 498 496 |
Test 9
Group: 3, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2 987 968 920 994 988 918 914 95... |
| correct output |
|---|
| 500 500 |
| user output |
|---|
| 500 500 |
Test 10
Group: 3, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2 996 1000 998 998 999 997 997 9... |
| correct output |
|---|
| 500 500 |
| user output |
|---|
| 500 500 |
Test 11
Group: 3, 5, 6
Verdict: ACCEPTED
| input |
|---|
| 1000 2 501 501 501 501 501 501 501 50... |
| correct output |
|---|
| 1 168 |
| user output |
|---|
| 1 168 |
Test 12
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 200 145 136 74 83 73 36 196 115 11... |
| correct output |
|---|
| 194 190 189 183 182 181 181 17... |
| user output |
|---|
| (empty) |
Test 13
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 200 157 110 168 155 192 107 146 15... |
| correct output |
|---|
| 95 96 96 95 93 94 94 94 90 91 ... |
| user output |
|---|
| (empty) |
Test 14
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 50 200 137 118 160 118 146 160 140 18... |
| correct output |
|---|
| 98 98 98 96 90 91 88 88 84 86 ... |
| user output |
|---|
| (empty) |
Test 15
Group: 4, 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100 200 147 174 186 148 155 128 158 18... |
| correct output |
|---|
| 99 99 98 98 97 97 96 96 95 95 ... |
| user output |
|---|
| (empty) |
Test 16
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 2000 928772177 816188227 216592201 ... |
| correct output |
|---|
| 991676844 990940224 990685481 ... |
| user output |
|---|
| (empty) |
Test 17
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 2000 665759876 597950008 615453266 ... |
| correct output |
|---|
| 498801198 498681904 498504321 ... |
| user output |
|---|
| (empty) |
Test 18
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 500 2000 683288817 784230412 626685186 ... |
| correct output |
|---|
| 497667621 498434895 495465990 ... |
| user output |
|---|
| (empty) |
Test 19
Group: 5, 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 1000 2000 666667000 809309500 571572000 ... |
| correct output |
|---|
| 499499500 499249250 498999000 ... |
| user output |
|---|
| (empty) |
Test 20
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 861772559 734298084 983382252 ... |
| correct output |
|---|
| 499973914 499985299 499985141 ... |
| user output |
|---|
| (empty) |
Test 21
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 30000 200000 691834579 617419813 514778075 ... |
| correct output |
|---|
| 499967533 499976270 499969810 ... |
| user output |
|---|
| (empty) |
Test 22
Group: 6
Verdict: TIME LIMIT EXCEEDED
| input |
|---|
| 100000 200000 820255000 960780000 741965000 ... |
| correct output |
|---|
| 499995000 499992500 499990000 ... |
| user output |
|---|
| (empty) |
