CSES - Datatähti 2021 loppu - Results
Submission details
Task:Koodarit
Sender:nikolai2001
Submission time:2021-01-23 19:54:12 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#20.01 s1, 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.03 s2, 3details
#180.03 s2, 3details
#190.03 s2, 3details
#200.03 s2, 3details
#210.03 s2, 3details
#220.03 s2, 3details
#230.03 s2, 3details
#240.06 s3details
#250.06 s3details
#260.06 s3details
#270.06 s3details
#280.06 s3details
#290.06 s3details
#300.06 s3details
#310.06 s3details

Code

#include<bits/stdc++.h>

using namespace std;

int elements[100000];

struct df{
    int sz;
    int pos;

    bool operator < (df &other){
        return sz < other.sz;
    }
};

df diff[100001];

int main(int argc, char *argv[]){
    int n, pairs;

    cin >> n >> pairs;

    for(int i = 0; i < n; i++) cin >> (elements[i]);

    sort(elements, elements + n);

    for(int i = 0; i < n - 1; i++){
        diff[i] = {abs(elements[i] - elements[i + 1]), i};
    }

    sort(diff, diff + (n - 1), [](df &a, df &b){
        return a.sz > b.sz;
    });

    

    int extra = (n - 1) -  pairs;

    int ssss = diff[extra - 1].sz;

    int ee = extra;
    while(ee < n - 1 && diff[ee].sz >= ssss) ee++;

    sort(diff, diff + ee, [](df &a, df &b){
        return a.pos < b.pos;
    });

    diff[ee].pos = 10000000;

    int skip = 0;

    int fine = 0;

    for(int i = 0; i < n - 1;){
        if(i == diff[skip].pos){
            i++; skip++;
            continue;
        }

        if(i + 1== diff[skip].pos){
            skip++;
        }

        //cout << "Pair: " << elements[i] << ", " << elements[i + 1] << endl;

        fine+= abs(elements[i] - elements[i+1]);

        i+=2;
    }

    fine += (ee - extra) * ssss;


    cout << fine << endl;
}

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
0

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
2

Test 7

Group: 1, 2, 3

Verdict:

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

correct output
213

user output
96

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
23707180

Test 13

Group: 1, 3

Verdict:

input
2000 231
801945178 924940258 369188694 ...

correct output
7831421

user output
6561016

Test 14

Group: 1, 3

Verdict:

input
2000 461
464790475 932031556 838378103 ...

correct output
37272564

user output
25119534

Test 15

Group: 1, 3

Verdict:

input
2000 100
484046702 267135814 995006323 ...

correct output
1268400

user output
1123690

Test 16

Group: 1, 3

Verdict:

input
2000 996
98352148 438929491 242618159 1...

correct output
445965905

user output
99028606

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:

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

correct output
0

user output
(empty)

Test 19

Group: 2, 3

Verdict:

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

correct output
0

user output
(empty)

Test 20

Group: 2, 3

Verdict:

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

correct output
322

user output
(empty)

Test 21

Group: 2, 3

Verdict:

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

correct output
245

user output
(empty)

Test 22

Group: 2, 3

Verdict:

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

correct output
290

user output
(empty)

Test 23

Group: 2, 3

Verdict:

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

correct output
252

user output
(empty)

Test 24

Group: 3

Verdict:

input
195426 76599
442872072 619088799 118541378 ...

correct output
143376538

user output
(empty)

Test 25

Group: 3

Verdict:

input
200000 1661
894106972 620084612 931442312 ...

correct output
33089

user output
(empty)

Test 26

Group: 3

Verdict:

input
200000 86032
211444153 846442677 297198384 ...

correct output
196001810

user output
(empty)

Test 27

Group: 3

Verdict:

input
200000 28275
28280312 349705372 96535649 84...

correct output
11627219

user output
(empty)

Test 28

Group: 3

Verdict:

input
200000 81473
178022892 112774306 250584651 ...

correct output
162430841

user output
(empty)

Test 29

Group: 3

Verdict:

input
200000 99987
297598052 494409138 182268523 ...

correct output
489497036

user output
(empty)

Test 30

Group: 3

Verdict:

input
200000 99971
316462272 843156468 434342923 ...

correct output
483167476

user output
(empty)

Test 31

Group: 3

Verdict:

input
200000 99964
811543559 465033274 620180191 ...

correct output
481497328

user output
(empty)