| Task: | Programmers |
| Sender: | AMnu |
| Submission time: | 2026-11-14 09:17:56 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 0 |
| subtask | verdict | score |
|---|---|---|
| #1 | WRONG ANSWER | 0 |
| #2 | WRONG ANSWER | 0 |
| #3 | WRONG ANSWER | 0 |
| test | verdict | time | subtask | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #5 | WRONG ANSWER | 0.00 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.00 s | 1, 2, 3 | details |
| #8 | WRONG ANSWER | 0.01 s | 1, 2, 3 | details |
| #9 | ACCEPTED | 0.01 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 | ACCEPTED | 0.01 s | 1, 3 | details |
| #13 | ACCEPTED | 0.01 s | 1, 3 | details |
| #14 | ACCEPTED | 0.01 s | 1, 3 | details |
| #15 | ACCEPTED | 0.01 s | 1, 3 | details |
| #16 | ACCEPTED | 0.01 s | 1, 3 | details |
| #17 | WRONG ANSWER | 0.03 s | 2, 3 | details |
| #18 | WRONG ANSWER | 0.09 s | 2, 3 | details |
| #19 | WRONG ANSWER | 0.09 s | 2, 3 | details |
| #20 | ACCEPTED | 0.09 s | 2, 3 | details |
| #21 | ACCEPTED | 0.09 s | 2, 3 | details |
| #22 | ACCEPTED | 0.09 s | 2, 3 | details |
| #23 | ACCEPTED | 0.09 s | 2, 3 | details |
| #24 | ACCEPTED | 0.14 s | 3 | details |
| #25 | ACCEPTED | 0.14 s | 3 | details |
| #26 | ACCEPTED | 0.14 s | 3 | details |
| #27 | ACCEPTED | 0.14 s | 3 | details |
| #28 | ACCEPTED | 0.14 s | 3 | details |
| #29 | ACCEPTED | 0.14 s | 3 | details |
| #30 | ACCEPTED | 0.14 s | 3 | details |
| #31 | ACCEPTED | 0.14 s | 3 | details |
Code
#include <bits/stdc++.h>
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef pair<ll,int> pii;
const int MAXN = 2e5+5;
int N, K, X[MAXN];
pii dp[MAXN];
void solve(int P) {
for (int i=2;i<=N;i++) {
dp[i] = max(pii(dp[i-2].fi+P-(X[i]-X[i-1]),dp[i-2].se+1),dp[i-1]);
}
}
int main() {
cin >> N >> K;
for (int i=1;i<=N;i++) {
cin >> X[i];
}
sort(X+1,X+N+1);
int L = 1, R = 1e9;
ll res = 0;
while (L <= R) {
int mid = (L+R)/2;
solve(mid);
if (dp[N].se >= K) {
res = mid;
R = mid-1;
}
else {
L = mid+1;
}
}
solve(res);
cout << K*res-dp[N].fi << "\n";
}
/*
pro = K*res;
dp[N].fi = pro-cost
dp[N].fi = K*res-cost
cost = K*res-dp[N].fi;
*/Test details
Test 1
Subtask: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 8 3 3 1 2 7 9 3 4 7 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 2
Subtask: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 2 1 2 13 |
| correct output |
|---|
| 11 |
| user output |
|---|
| 11 |
Test 3
Subtask: 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
Subtask: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 14 5 11 3 8 3 14 8 10 13 11 10 17 1... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 5
Subtask: 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 |
|---|
| -4 |
Feedback: Incorrect character on line 1 col 1: expected "0", got "-4"
Test 6
Subtask: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 10 3 10 19 16 15 12 5 14 8 3 15 |
| correct output |
|---|
| 4 |
| user output |
|---|
| 4 |
Test 7
Subtask: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 202 90 177 187 183 647 616 580 499 78... |
| correct output |
|---|
| 213 |
| user output |
|---|
| 213 |
Test 8
Subtask: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 2000 512 141 583 135 833 900 308 248 58... |
| correct output |
|---|
| 0 |
| user output |
|---|
| -239 |
Feedback: Incorrect character on line 1 col 1: expected "0", got "-239"
Test 9
Subtask: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 2000 972 685 4 289 865 93 159 48 866 56... |
| correct output |
|---|
| 276 |
| user output |
|---|
| 276 |
Test 10
Subtask: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 2000 1000 698 153 298 118 631 341 238 7 ... |
| correct output |
|---|
| 517 |
| user output |
|---|
| 517 |
Test 11
Subtask: 1, 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 2000 1 983 144 449 584 839 166 77 885... |
| correct output |
|---|
| 0 |
| user output |
|---|
| -750 |
Feedback: Incorrect character on line 1 col 1: expected "0", got "-750"
Test 12
Subtask: 1, 3
Verdict: ACCEPTED
| input |
|---|
| 1464 320 846762124 954854396 12767390 7... |
| correct output |
|---|
| 35809369 |
| user output |
|---|
| 35809369 |
Test 13
Subtask: 1, 3
Verdict: ACCEPTED
| input |
|---|
| 2000 231 801945178 924940258 369188694 ... |
| correct output |
|---|
| 7831421 |
| user output |
|---|
| 7831421 |
Test 14
Subtask: 1, 3
Verdict: ACCEPTED
| input |
|---|
| 2000 461 464790475 932031556 838378103 ... |
| correct output |
|---|
| 37272564 |
| user output |
|---|
| 37272564 |
Test 15
Subtask: 1, 3
Verdict: ACCEPTED
| input |
|---|
| 2000 100 484046702 267135814 995006323 ... |
| correct output |
|---|
| 1268400 |
| user output |
|---|
| 1268400 |
Test 16
Subtask: 1, 3
Verdict: ACCEPTED
| input |
|---|
| 2000 996 98352148 438929491 242618159 1... |
| correct output |
|---|
| 445965905 |
| user output |
|---|
| 445965905 |
Test 17
Subtask: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 65879 19675 896 316 972 476 636 227 716 78... |
| correct output |
|---|
| 0 |
| user output |
|---|
| -13018 |
Feedback: Incorrect character on line 1 col 1: expected "0", got "-13018"
Test 18
Subtask: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 200000 53820 995 720 135 767 943 742 191 26... |
| correct output |
|---|
| 0 |
| user output |
|---|
| -45940 |
Feedback: Incorrect character on line 1 col 1: expected "0", got "-45940"
Test 19
Subtask: 2, 3
Verdict: WRONG ANSWER
| input |
|---|
| 200000 32297 527 947 84 851 908 833 339 112... |
| correct output |
|---|
| 0 |
| user output |
|---|
| -67451 |
Feedback: Incorrect character on line 1 col 1: expected "0", got "-67451"
Test 20
Subtask: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 200000 99982 561 174 242 275 460 109 664 68... |
| correct output |
|---|
| 322 |
| user output |
|---|
| 322 |
Test 21
Subtask: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 200000 99955 911 33 314 861 298 117 972 982... |
| correct output |
|---|
| 245 |
| user output |
|---|
| 245 |
Test 22
Subtask: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 200000 99972 783 1000 673 611 87 452 702 92... |
| correct output |
|---|
| 290 |
| user output |
|---|
| 290 |
Test 23
Subtask: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 200000 99961 795 136 128 643 60 422 371 839... |
| correct output |
|---|
| 252 |
| user output |
|---|
| 252 |
Test 24
Subtask: 3
Verdict: ACCEPTED
| input |
|---|
| 195426 76599 442872072 619088799 118541378 ... |
| correct output |
|---|
| 143376538 |
| user output |
|---|
| 143376538 |
Test 25
Subtask: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 1661 894106972 620084612 931442312 ... |
| correct output |
|---|
| 33089 |
| user output |
|---|
| 33089 |
Test 26
Subtask: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 86032 211444153 846442677 297198384 ... |
| correct output |
|---|
| 196001810 |
| user output |
|---|
| 196001810 |
Test 27
Subtask: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 28275 28280312 349705372 96535649 84... |
| correct output |
|---|
| 11627219 |
| user output |
|---|
| 11627219 |
Test 28
Subtask: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 81473 178022892 112774306 250584651 ... |
| correct output |
|---|
| 162430841 |
| user output |
|---|
| 162430841 |
Test 29
Subtask: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 99987 297598052 494409138 182268523 ... |
| correct output |
|---|
| 489497036 |
| user output |
|---|
| 489497036 |
Test 30
Subtask: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 99971 316462272 843156468 434342923 ... |
| correct output |
|---|
| 483167476 |
| user output |
|---|
| 483167476 |
Test 31
Subtask: 3
Verdict: ACCEPTED
| input |
|---|
| 200000 99964 811543559 465033274 620180191 ... |
| correct output |
|---|
| 481497328 |
| user output |
|---|
| 481497328 |
