CSES - Datatähti Open 2021 - Results
Submission details
Task:Programmers
Sender:nigus
Submission time:2021-01-30 17:03:36 +0200
Language:C++17
Status:READY
Result:34
Feedback
groupverdictscore
#1ACCEPTED34
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.20 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#10ACCEPTED0.01 s1, 2, 3details
#11ACCEPTED0.01 s1, 2, 3details
#12ACCEPTED0.01 s1, 3details
#13ACCEPTED0.01 s1, 3details
#14ACCEPTED0.01 s1, 3details
#15ACCEPTED0.01 s1, 3details
#16ACCEPTED0.01 s1, 3details
#170.53 s2, 3details
#18--2, 3details
#19--2, 3details
#20ACCEPTED0.59 s2, 3details
#21--2, 3details
#22ACCEPTED0.28 s2, 3details
#23ACCEPTED0.63 s2, 3details
#24--3details
#25--3details
#26ACCEPTED0.34 s3details
#27--3details
#28ACCEPTED0.33 s3details
#29ACCEPTED0.20 s3details
#30ACCEPTED0.21 s3details
#31ACCEPTED0.23 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:87:10: warning: unused variable 'b' [-Wunused-variable]
     ll a,b,c,d;
          ^
input/code.cpp:87:12: warning: unused variable 'c' [-Wunused-variable]
     ll a,b,c,d;
            ^
input/code.cpp:87:14: warning: unused variable 'd' [-Wunused-variable]
     ll a,b,c,d;
              ^

Code

#pragma GCC optimize("O3")   //
#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, b, a) for(int i = b - 1; i >= a; i--)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef long double ld;
typedef unsigned long long ull;

unsigned seed = chrono::system_clock::now().time_since_epoch().count();
mt19937 eng(seed);

ll random2(){
    return (1ll << 31ll)*eng()+eng();
}

ll n,m,k,q,T;

const ll big = 1000000007;
const ll big2 = 1000000009;
const ll mod =  998244353;

const int MAXN = 200002;

vl X,A;

double DP1[MAXN];
int DP2[MAXN];
int DPC[MAXN] = {0};
int cc = 0;
ld alien = 0.0;

pair<ld, int> dp(int i){
    if(i >= n)return {0, 0};
    if(DPC[i] == cc)return {DP1[i], DP2[i]};
    pair<ld, int> temp1 = dp(i+1);
    pair<ld, int> temp2 = dp(i+2);
    temp2.second++;
    temp2.first += X[i]-alien;
    pair<ld, int> ans = min(temp1, temp2);
    DPC[i] = cc;
    DP1[i] = ans.first;
    DP2[i] = ans.second;
    return ans;
}


ld L = 0.0;
ld R = big;

ll solve1(){
    rep(c1,0,200){
        ld mid = (L+R)/2.0;
        alien = mid;
        cc++;
        pair<ld, int> res = dp(0);
        if(res.second < k){
            L = mid;
        }
        if(res.second > k){
            R = mid;
        }
        if(res.second == k){
            ld ans = res.first + ld(k)*alien;
          //  cerr << res.first << " " << alien << "  dfs\n";
            return round(ans);
        }
    }
    return -1;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    //freopen("fhc.txt","r",stdin);
    //freopen("autput.txt","w",stdout);

    ll a,b,c,d;

    cin >> n >> k;

    rep(c1,0,n){
        cin >> a;
       // a = random2()%1000000000;

        A.push_back(a);
    }
    sort(all(A));

    ll sec = 0;
    rep(c1,0,n-1){
        if(c1%2 == 0)sec += A[c1+1]-A[c1];
    }

    /*
    if(k == n/2){
        cout << sec << "\n";
        return 0;
    }
    */

    vi Y;
    rep(c1,0,n-1){
        X.push_back(A[c1+1]-A[c1]);
    }
    n--;



    ll ans1 = solve1();

    //cerr << ans1 << " " << sec << "  f ds\n";

    if(ans1 != -1){
        cout << ans1 << "\n";
        return 0;
    }

    if(n <= 2000){
        unordered_map<ll,ll> M;
        for(int K = 0; K <= k; K++){
            for(int N = n+1; N >= 0; N--){
                int h = N*(n+4)+K;
                if(N >= n){
                    M[h] = big*big*(K != 0);
                }
                else{
                    ll h1 = (N+1)*(n+4)+K;
                    ll h2 = (N+2)*(n+4)+K-1;
                    M[h] = min(M[h1], M[h2]+X[N]);
                }
            }
        }
        cout << M[k] << "\n";
        //cerr << d << "  d\n";
        /*
        if(d != M[k]){
            cerr << "!!!!\n";
            cerr << M[k] << "  != " << d << "\n";
            rep(c1,0,n+1){
                cerr << A[c1] << " ";
            }cerr << "\n";
        }
*/
        return 0;
    }

    if(ans1 == -1){
        ll sum = 0;
        vl X1, X2;
        rep(c1,0,n){
            sum += X[c1];
            if(c1%2 == 0){
                X1.push_back(X[c1]);
            }
            else{
                X2.push_back(X[c1]);
            }
        }
        sort(all(X1));
        sort(all(X2));
        reverse(all(X1));
        reverse(all(X2));

        ll ma = -1;
        if(sz(X1) >= k){
            ll temp = 0;
            rep(c1,0,k){
                temp += X1[c1];
            }
            ma = max(ma, temp);
        }
        if(sz(X2) >= k){
            ll temp = 0;
            rep(c1,0,k){
                temp += X2[c1];
            }
            ma = max(ma, temp);
        }
        cout << sum-ma << "\n";
    }
    else{
        cout << ans1 << "\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: 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: 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: ACCEPTED

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

correct output
4

user output
4

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
213

user output
213

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

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

correct output
276

user output
276

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

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

correct output
0

user output
0

Test 12

Group: 1, 3

Verdict: ACCEPTED

input
1464 320
846762124 954854396 12767390 7...

correct output
35809369

user output
35809369

Test 13

Group: 1, 3

Verdict: ACCEPTED

input
2000 231
801945178 924940258 369188694 ...

correct output
7831421

user output
7831421

Test 14

Group: 1, 3

Verdict: ACCEPTED

input
2000 461
464790475 932031556 838378103 ...

correct output
37272564

user output
37272564

Test 15

Group: 1, 3

Verdict: ACCEPTED

input
2000 100
484046702 267135814 995006323 ...

correct output
1268400

user output
1268400

Test 16

Group: 1, 3

Verdict: ACCEPTED

input
2000 996
98352148 438929491 242618159 1...

correct output
445965905

user output
445965905

Test 17

Group: 2, 3

Verdict:

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

correct output
0

user output
484

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

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

correct output
322

user output
322

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

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

correct output
290

user output
290

Test 23

Group: 2, 3

Verdict: ACCEPTED

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

correct output
252

user output
252

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

input
200000 86032
211444153 846442677 297198384 ...

correct output
196001810

user output
196001810

Test 27

Group: 3

Verdict:

input
200000 28275
28280312 349705372 96535649 84...

correct output
11627219

user output
(empty)

Test 28

Group: 3

Verdict: ACCEPTED

input
200000 81473
178022892 112774306 250584651 ...

correct output
162430841

user output
162430841

Test 29

Group: 3

Verdict: ACCEPTED

input
200000 99987
297598052 494409138 182268523 ...

correct output
489497036

user output
489497036

Test 30

Group: 3

Verdict: ACCEPTED

input
200000 99971
316462272 843156468 434342923 ...

correct output
483167476

user output
483167476

Test 31

Group: 3

Verdict: ACCEPTED

input
200000 99964
811543559 465033274 620180191 ...

correct output
481497328

user output
481497328