CSES - Datatähti Open 2021 - Results
Submission details
Task:Programmers
Sender:doowey
Submission time:2021-01-31 16:37:53 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2--1, 2, 3details
#30.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#60.01 s1, 2, 3details
#70.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#90.01 s1, 2, 3details
#100.01 s1, 2, 3details
#11ACCEPTED0.01 s1, 2, 3details
#120.01 s1, 3details
#130.01 s1, 3details
#140.01 s1, 3details
#150.01 s1, 3details
#160.01 s1, 3details
#17ACCEPTED0.04 s2, 3details
#18ACCEPTED0.11 s2, 3details
#19ACCEPTED0.11 s2, 3details
#200.13 s2, 3details
#210.12 s2, 3details
#220.11 s2, 3details
#230.11 s2, 3details
#240.25 s3details
#250.25 s3details
#260.26 s3details
#270.25 s3details
#280.26 s3details
#290.26 s3details
#300.26 s3details
#310.26 s3details

Code

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, int> pii;

#define fi first
#define se second
#define mp make_pair

const int N = (int)2e5 + 100;
ll d[N];
ll x[N];

int main(){
    int n,k;
    cin >> n >> k;
    for(int i = 0 ;i < n; i ++ ){
        cin >> x[i];
    }
    sort(x, x + n);
    for(int i = 0 ; i + 1 < n; i ++ ){
        d[i]=(x[i+1]-x[i]);
    }
    int m = n - 1;
    ll cum = 0;
    set<pii> qq;
    for(int i = 0 ; i < m ; i ++ ){
        qq.insert(mp(d[i], i));
    }
    int id;
    bool keep;
    for(int j = 0 ;j < k ; j ++ ){
        auto it = qq.begin();
        cum += it->fi;
        id = it->se;
        auto nx = qq.erase(it);
        d[id]=-d[id];
        keep = true;
        if(nx == qq.end()){
            keep = false;
        }
        else{
            d[id] += d[nx->se];
            qq.erase(nx);
        }
        if(nx == qq.begin()){
            keep = false;
            qq.erase(nx);
        }
        else{
            d[id] += d[nx->se];
        }
        if(keep)
            qq.insert(mp(d[id],id));
    }
    cout << cum << "\n";
    return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
8 3
3 1 2 7 9 3 4 7

correct output
1

user output
1

Test 2

Group: 1, 2, 3

Verdict:

input
2 1
2 13

correct output
11

user output
(empty)

Test 3

Group: 1, 2, 3

Verdict:

input
20 10
16 20 6 15 19 12 11 17 20 6 15...

correct output
6

user output
0

Test 4

Group: 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

Group: 1, 2, 3

Verdict: ACCEPTED

input
15 1
8 5 1 8 18 15 6 20 14 9 10 9 1...

correct output
0

user output
0

Test 6

Group: 1, 2, 3

Verdict:

input
10 3
10 19 16 15 12 5 14 8 3 15

correct output
4

user output
3

Test 7

Group: 1, 2, 3

Verdict:

input
202 90
177 187 183 647 616 580 499 78...

correct output
213

user output
122

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
2000 512
141 583 135 833 900 308 248 58...

correct output
0

user output
0

Test 9

Group: 1, 2, 3

Verdict:

input
2000 972
685 4 289 865 93 159 48 866 56...

correct output
276

user output
0

Test 10

Group: 1, 2, 3

Verdict:

input
2000 1000
698 153 298 118 631 341 238 7 ...

correct output
517

user output
0

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

input
2000 1
983 144 449 584 839 166 77 885...

correct output
0

user output
0

Test 12

Group: 1, 3

Verdict:

input
1464 320
846762124 954854396 12767390 7...

correct output
35809369

user output
29145499

Test 13

Group: 1, 3

Verdict:

input
2000 231
801945178 924940258 369188694 ...

correct output
7831421

user output
7225584

Test 14

Group: 1, 3

Verdict:

input
2000 461
464790475 932031556 838378103 ...

correct output
37272564

user output
31196666

Test 15

Group: 1, 3

Verdict:

input
2000 100
484046702 267135814 995006323 ...

correct output
1268400

user output
1208944

Test 16

Group: 1, 3

Verdict:

input
2000 996
98352148 438929491 242618159 1...

correct output
445965905

user output
151020417

Test 17

Group: 2, 3

Verdict: ACCEPTED

input
65879 19675
896 316 972 476 636 227 716 78...

correct output
0

user output
0

Test 18

Group: 2, 3

Verdict: ACCEPTED

input
200000 53820
995 720 135 767 943 742 191 26...

correct output
0

user output
0

Test 19

Group: 2, 3

Verdict: ACCEPTED

input
200000 32297
527 947 84 851 908 833 339 112...

correct output
0

user output
0

Test 20

Group: 2, 3

Verdict:

input
200000 99982
561 174 242 275 460 109 664 68...

correct output
322

user output
0

Test 21

Group: 2, 3

Verdict:

input
200000 99955
911 33 314 861 298 117 972 982...

correct output
245

user output
0

Test 22

Group: 2, 3

Verdict:

input
200000 99972
783 1000 673 611 87 452 702 92...

correct output
290

user output
0

Test 23

Group: 2, 3

Verdict:

input
200000 99961
795 136 128 643 60 422 371 839...

correct output
252

user output
0

Test 24

Group: 3

Verdict:

input
195426 76599
442872072 619088799 118541378 ...

correct output
143376538

user output
90237108

Test 25

Group: 3

Verdict:

input
200000 1661
894106972 620084612 931442312 ...

correct output
33089

user output
32972

Test 26

Group: 3

Verdict:

input
200000 86032
211444153 846442677 297198384 ...

correct output
196001810

user output
109576234

Test 27

Group: 3

Verdict:

input
200000 28275
28280312 349705372 96535649 84...

correct output
11627219

user output
10422864

Test 28

Group: 3

Verdict:

input
200000 81473
178022892 112774306 250584651 ...

correct output
162430841

user output
97392269

Test 29

Group: 3

Verdict:

input
200000 99987
297598052 494409138 182268523 ...

correct output
489497036

user output
153233903

Test 30

Group: 3

Verdict:

input
200000 99971
316462272 843156468 434342923 ...

correct output
483167476

user output
153425856

Test 31

Group: 3

Verdict:

input
200000 99964
811543559 465033274 620180191 ...

correct output
481497328

user output
152582494