CSES - Datatähti Open 2021 - Results
Submission details
Task:Programmers
Sender:rivalq
Submission time:2021-01-31 13:09:57 +0200
Language:C++11
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED34
#2ACCEPTED21
#3ACCEPTED45
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.01 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
#17ACCEPTED0.03 s2, 3details
#18ACCEPTED0.06 s2, 3details
#19ACCEPTED0.06 s2, 3details
#20ACCEPTED0.06 s2, 3details
#21ACCEPTED0.06 s2, 3details
#22ACCEPTED0.06 s2, 3details
#23ACCEPTED0.07 s2, 3details
#24ACCEPTED0.13 s3details
#25ACCEPTED0.13 s3details
#26ACCEPTED0.14 s3details
#27ACCEPTED0.13 s3details
#28ACCEPTED0.14 s3details
#29ACCEPTED0.13 s3details
#30ACCEPTED0.12 s3details
#31ACCEPTED0.12 s3details

Code

// Jai Shree Ram  
  
#include<bits/stdc++.h>
using namespace std;

#define rep(i,a,n)     for(int i=a;i<n;i++)
#define ll             long long
#define int            long long
#define pb             push_back
#define all(v)         v.begin(),v.end()
#define endl           "\n"
#define x              first
#define y              second
#define gcd(a,b)       __gcd(a,b)
#define mem1(a)        memset(a,-1,sizeof(a))
#define mem0(a)        memset(a,0,sizeof(a))
#define sz(a)          (int)a.size()
#define pii            pair<int,int>
#define hell           1000000007
#define elasped_time   1.0 * clock() / CLOCKS_PER_SEC



template<typename T1,typename T2>istream& operator>>(istream& in,pair<T1,T2> &a){in>>a.x>>a.y;return in;}
template<typename T1,typename T2>ostream& operator<<(ostream& out,pair<T1,T2> a){out<<a.x<<" "<<a.y;return out;}
template<typename T,typename T1>T maxs(T &a,T1 b){if(b>a)a=b;return a;}
template<typename T,typename T1>T mins(T &a,T1 b){if(b<a)a=b;return a;}


int solve(){
 		int n,k;cin>>n>>k;
 		vector<int>a(n+1);
 		rep(i,1,n+1){
 			cin>>a[i];
 		}
 		sort(a.begin()+1,a.end());
 		vector<int>t={0};
 		int s=0;
 		for(int i=2;i<=n;i++){
 			t.push_back(a[i]-a[i-1]);
 			s+=a[i]-a[i-1];
 		}
 		int m=sz(t)-1;
 		auto get=[&](int x){
 			vector<int>dp(m+1),cnt(m+1);
 			dp[0]=0;cnt[0]=0;
 			if(dp[0]==t[1]+x){
 				dp[1]=dp[0];
 				cnt[1]=1;
 			}
 			else if(dp[0]<t[1]+x){
 				dp[1]=dp[0];
 			}
 			else{
 				dp[1]=t[1]+x;
 				cnt[1]=1;
 			}
 			rep(i,2,m+1){
 				// yaa to i ayega
 				//dp[i]=dp[i-2]+x+t[i],cnt[i]=cnt[i-2]+1;
 				//dp[i]=dp[i-1],cnt[i]=cnt[i-1];
 				if(dp[i-1]==dp[i-2]+x+t[i]){
 					dp[i]=dp[i-1];
 					cnt[i]=max(cnt[i-2]+1,cnt[i]);
 				}
 				else if(dp[i-1]<dp[i-2]+x+t[i]){
 					dp[i]=dp[i-1];
 					cnt[i]=cnt[i-1];
 				}	
 				else{
 					dp[i]=dp[i-2]+x+t[i];
 					cnt[i]=cnt[i-2]+1;
 				}

 			}
 			return make_pair(cnt[m],dp[m]);
 		};
 		int l=-s,r=s;
 		int ans=0;
 		while(l<=r){
 			int m=l+(r-l)/2;
 			auto res=get(m);
 			//cout<<res<<endl;
 			//cout<<res.y-k*m<<endl;
 			if(res.x>=k)ans=res.y-k*m,l=m+1;
 			else r=m-1;
 		}	
 		cout<<ans<<endl;
 return 0;
}
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #ifdef SIEVE
    sieve();
    #endif
    #ifdef NCR
    init();
    #endif
    int t=1;//cin>>t;
    while(t--){
        solve();
    }
    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: 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: ACCEPTED

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

correct output
322

user output
322

Test 21

Group: 2, 3

Verdict: ACCEPTED

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

correct output
245

user output
245

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

input
195426 76599
442872072 619088799 118541378 ...

correct output
143376538

user output
143376538

Test 25

Group: 3

Verdict: ACCEPTED

input
200000 1661
894106972 620084612 931442312 ...

correct output
33089

user output
33089

Test 26

Group: 3

Verdict: ACCEPTED

input
200000 86032
211444153 846442677 297198384 ...

correct output
196001810

user output
196001810

Test 27

Group: 3

Verdict: ACCEPTED

input
200000 28275
28280312 349705372 96535649 84...

correct output
11627219

user output
11627219

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