CSES - Datatähti Open 2021 - Results
Submission details
Task:Programmers
Sender:socho
Submission time:2021-01-30 17:26:52 +0200
Language:C++17
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#30.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
#100.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
#160.01 s1, 3details
#17ACCEPTED0.07 s2, 3details
#18ACCEPTED0.14 s2, 3details
#19ACCEPTED0.13 s2, 3details
#200.17 s2, 3details
#210.17 s2, 3details
#220.17 s2, 3details
#230.17 s2, 3details
#240.40 s3details
#250.42 s3details
#260.42 s3details
#270.43 s3details
#280.40 s3details
#290.41 s3details
#300.41 s3details
#310.41 s3details

Compiler report

input/code.cpp: In function 'void usaco()':
input/code.cpp:15:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen("problem.in", "r", stdin);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:16:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  freopen("problem.out", "w", stdout);
  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

#include <bits/stdc++.h>
using namespace std;
void fast() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
}
void ran() {
	srand(chrono::steady_clock::now().time_since_epoch().count());
}
long long get_rand() {
	long long a = rand();
	long long b = rand();
	return a * (RAND_MAX + 1ll) + b;
}
void usaco() {
	freopen("problem.in", "r", stdin); 
	freopen("problem.out", "w", stdout);
}
template<typename T>
using min_pq = priority_queue<T, vector<T>, greater<T>>;
// #define endl '\n'
// #define double long double
#define int long long
// const int MOD = 1000 * 1000 * 1000 + 7;
// const int MOD = 998244353;

const int MXN = 100005;
int par[MXN];
int score[MXN];
int lb[MXN];
int rb[MXN];

int parent(int n) {
	if (par[n] == n) return n;
	return par[n] = parent(par[n]);
}

void conn(int a, int b) {
	a = parent(a);
	b = parent(b);
	if (a == b) return;
	par[b] = a;
	lb[a] = min(lb[a], lb[b]);
	rb[a] = max(rb[a], rb[b]);
}

signed main() {

	ran(); fast();

	int n, k;
	cin >> n >> k;
	
	int arr[n];
	for (int i=0; i<n; i++) cin >> arr[i];
	sort(arr, arr+n);
	
	for (int i=0; i<MXN; i++) {
		par[i] = i;
		lb[i] = i;
		rb[i] = i;
	}
	
	map<pair<int, int>, bool> can;
	min_pq<pair<int, pair<int, int>>> tra;
	for (int i=1; i<n; i++) {
		score[i] = arr[i] - arr[i-1];
		tra.push({score[i], {i, i}});
		can[{i, i}] = true;
	}
	
	int ans = 0;
	
	for (int i=0; i<k; i++) {
		
		pair<int, pair<int, int>> x;
		
		while (true) {
			x = tra.top(); tra.pop();
			if (can[x.second]) break;
		}
		
		int v = x.first, l = x.second.first, r = x.second.second;
		ans += v;
		can[{l, r}] = false;
		
		bool mergeboth = true;
		if (l > 1) {
			int before = parent(l-1);
			int L = lb[before], R = rb[before];
			can[{L, R}] = false;
		}
		else {
			mergeboth = false;
		}
		
		if (r < n) {
			int after = parent(r+1);
			int L = lb[after], R = rb[after];
			can[{L, R}] = false;
		}
		else {
			mergeboth = false;
		}
		
		if (mergeboth) {
			int nws = score[parent(l-1)] + score[parent(r+1)] - v;
			conn(l-1, l); conn(r, r+1);
			int nx = parent(l);
			
			int L = lb[nx], R = rb[nx];
			can[{L, R}] = true;
			score[nx] = nws;
			tra.push({nws, {L, R}});
		}
		
	}
	
	cout << ans << 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: ACCEPTED

input
2 1
2 13

correct output
11

user output
11

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
5

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:

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

correct output
517

user output
467

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:

input
2000 996
98352148 438929491 242618159 1...

correct output
445965905

user output
434967160

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
(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)