Task: | Programmers |
Sender: | tutis |
Submission time: | 2021-01-31 00:04:21 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
#2 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#3 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#4 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
#5 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
#6 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
#7 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
#8 | WRONG ANSWER | 0.02 s | 1, 2, 3 | details |
#9 | WRONG ANSWER | 0.03 s | 1, 2, 3 | details |
#10 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
#11 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
#12 | WRONG ANSWER | 0.01 s | 1, 3 | details |
#13 | WRONG ANSWER | 0.01 s | 1, 3 | details |
#14 | WRONG ANSWER | 0.02 s | 1, 3 | details |
#15 | WRONG ANSWER | 0.01 s | 1, 3 | details |
#16 | WRONG ANSWER | 0.02 s | 1, 3 | details |
#17 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#18 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#19 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#20 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#21 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#22 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#23 | TIME LIMIT EXCEEDED | -- | 2, 3 | details |
#24 | TIME LIMIT EXCEEDED | -- | 3 | details |
#25 | TIME LIMIT EXCEEDED | -- | 3 | details |
#26 | TIME LIMIT EXCEEDED | -- | 3 | details |
#27 | TIME LIMIT EXCEEDED | -- | 3 | details |
#28 | TIME LIMIT EXCEEDED | -- | 3 | details |
#29 | TIME LIMIT EXCEEDED | -- | 3 | details |
#30 | TIME LIMIT EXCEEDED | -- | 3 | details |
#31 | TIME LIMIT EXCEEDED | -- | 3 | details |
Code
/*input 8 3 1 2 3 3 4 7 7 9 */ #pragma GCC optimize ("O3") #pragma GCC target ("avx2") #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> using namespace std; using namespace __gnu_pbds; template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template<typename T, typename X> using ordered_map = tree<T, X, less<T>, rb_tree_tag, tree_order_statistics_node_update>; template<typename T, typename X> using fast_map = cc_hash_table<T, X>; //using ull = __uint128_t; using ull = unsigned long long; using ll = long long; using ld = long double; mt19937_64 rng(123); const ll mod = 1000000007; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; int x[n]; for (int i = 0; i < n; i++) cin >> x[i]; vector<bool>set(n, false); sort(x, x + n); int sum = 0; for (int i = 0; i < 2 * k; i += 2) { sum += x[i + 1] - x[i]; set[i + 1] = true; } int ans = sum; priority_queue<pair<int, int>>Q; auto f = [&](int i)->pair<int, int> { return {2 * x[i] - x[i - 1] - x[i + 1], i}; }; if (2 * k < n) { Q.push(f(2 * k - 1)); } while (!Q.empty()) { sum -= Q.top().first; ans = min(ans, sum); int i = Q.top().second; Q.pop(); set[i] = false; set[i + 1] = true; x[i] = false; x[i + 1] = true; if (i == 2 || (i >= 3 && set[i - 2])) Q.push(f(i - 2)); if (i + 2 < n) Q.push(f(i + 2)); } cout << ans << "\n"; }
Test details
Test 1
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
8 3 3 1 2 7 9 3 4 7 |
correct output |
---|
1 |
user output |
---|
-4928 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
2 1 2 13 |
correct output |
---|
11 |
user output |
---|
11 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
20 10 16 20 6 15 19 12 11 17 20 6 15... |
correct output |
---|
6 |
user output |
---|
6 |
Test 4
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
14 5 11 3 8 3 14 8 10 13 11 10 17 1... |
correct output |
---|
0 |
user output |
---|
-1431669128 |
Test 5
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
15 1 8 5 1 8 18 15 6 20 14 9 10 9 1... |
correct output |
---|
0 |
user output |
---|
-47 |
Test 6
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
10 3 10 19 16 15 12 5 14 8 3 15 |
correct output |
---|
4 |
user output |
---|
-1431661123 |
Test 7
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
202 90 177 187 183 647 616 580 499 78... |
correct output |
---|
213 |
user output |
---|
-1432066956 |
Test 8
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
2000 512 141 583 135 833 900 308 248 58... |
correct output |
---|
0 |
user output |
---|
-368388 |
Test 9
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
2000 972 685 4 289 865 93 159 48 866 56... |
correct output |
---|
276 |
user output |
---|
-33002 |
Test 10
Group: 1, 2, 3
Verdict: ACCEPTED
input |
---|
2000 1000 698 153 298 118 631 341 238 7 ... |
correct output |
---|
517 |
user output |
---|
517 |
Test 11
Group: 1, 2, 3
Verdict: WRONG ANSWER
input |
---|
2000 1 983 144 449 584 839 166 77 885... |
correct output |
---|
0 |
user output |
---|
-514665 |
Test 12
Group: 1, 3
Verdict: WRONG ANSWER
input |
---|
1464 320 846762124 954854396 12767390 7... |
correct output |
---|
35809369 |
user output |
---|
-2146451754 |
Test 13
Group: 1, 3
Verdict: WRONG ANSWER
input |
---|
2000 231 801945178 924940258 369188694 ... |
correct output |
---|
7831421 |
user output |
---|
-2129315433 |
Test 14
Group: 1, 3
Verdict: WRONG ANSWER
input |
---|
2000 461 464790475 932031556 838378103 ... |
correct output |
---|
37272564 |
user output |
---|
-2133654538 |
Test 15
Group: 1, 3
Verdict: WRONG ANSWER
input |
---|
2000 100 484046702 267135814 995006323 ... |
correct output |
---|
1268400 |
user output |
---|
-2145656329 |
Test 16
Group: 1, 3
Verdict: WRONG ANSWER
input |
---|
2000 996 98352148 438929491 242618159 1... |
correct output |
---|
445965905 |
user output |
---|
-1494076703 |
Test 17
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
65879 19675 896 316 972 476 636 227 716 78... |
correct output |
---|
0 |
user output |
---|
(empty) |
Test 18
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 53820 995 720 135 767 943 742 191 26... |
correct output |
---|
0 |
user output |
---|
(empty) |
Test 19
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 32297 527 947 84 851 908 833 339 112... |
correct output |
---|
0 |
user output |
---|
(empty) |
Test 20
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 99982 561 174 242 275 460 109 664 68... |
correct output |
---|
322 |
user output |
---|
(empty) |
Test 21
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 99955 911 33 314 861 298 117 972 982... |
correct output |
---|
245 |
user output |
---|
(empty) |
Test 22
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 99972 783 1000 673 611 87 452 702 92... |
correct output |
---|
290 |
user output |
---|
(empty) |
Test 23
Group: 2, 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 99961 795 136 128 643 60 422 371 839... |
correct output |
---|
252 |
user output |
---|
(empty) |
Test 24
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
195426 76599 442872072 619088799 118541378 ... |
correct output |
---|
143376538 |
user output |
---|
(empty) |
Test 25
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 1661 894106972 620084612 931442312 ... |
correct output |
---|
33089 |
user output |
---|
(empty) |
Test 26
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 86032 211444153 846442677 297198384 ... |
correct output |
---|
196001810 |
user output |
---|
(empty) |
Test 27
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 28275 28280312 349705372 96535649 84... |
correct output |
---|
11627219 |
user output |
---|
(empty) |
Test 28
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 81473 178022892 112774306 250584651 ... |
correct output |
---|
162430841 |
user output |
---|
(empty) |
Test 29
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 99987 297598052 494409138 182268523 ... |
correct output |
---|
489497036 |
user output |
---|
(empty) |
Test 30
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 99971 316462272 843156468 434342923 ... |
correct output |
---|
483167476 |
user output |
---|
(empty) |
Test 31
Group: 3
Verdict: TIME LIMIT EXCEEDED
input |
---|
200000 99964 811543559 465033274 620180191 ... |
correct output |
---|
481497328 |
user output |
---|
(empty) |