CSES - APIO 2007 - Results
Submission details
Task:Backup
Sender:Yytsi
Submission time:2019-03-07 17:58:18 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#30.01 s3details
#40.02 s3details
#5ACCEPTED0.02 s1, 2, 3details
#6--2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#80.02 s1, 2, 3details
#9--2, 3details
#10--2, 3details
#110.03 s3details
#120.03 s3details
#130.02 s3details
#14ACCEPTED0.01 s1, 2, 3details
#150.03 s2, 3details
#160.02 s3details
#170.03 s3details
#18ACCEPTED0.03 s2, 3details
#19--2, 3details
#200.01 s3details

Code

#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define IO ios_base::sync_with_stdio(0); cin.tie(0)
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define N 10004
bool able[N];
ll val[N];
map<pii, ll> dp;
int n, k;
ll m = 99999999999999999LL;

ll f(int p, int moves, ll sm) {
	if (p > n) {
		if (moves == 0) return sm;
		return 9999999999999999;
	}

	if (moves == 0) return sm;

	auto search = dp.find((pii){p, moves});
	if (search != dp.end()) return sm + search->S;

	ll r = f(p+1, moves, sm);	

	for (int take = p+1; take <= n; take++) {
		r = min(r, f(take+1, moves-1, sm + abs(val[take]-val[p]))); 
	}

	dp[(pii){p, moves}] = r;
	return r;
}

int main() {
	IO; cin>>n>>k;
	FOR(i,1,n+1) cin>>val[i];
	cout<<f(1, k, 0)<<"\n";
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
2 1
0
1000000000

correct output
1000000000

user output
1000000000

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
17 8
101266
101394
101458
101490
...

correct output
340

user output
340

Test 3

Group: 3

Verdict:

input
100000 49000
29983
53806
76909
106815
...

correct output
411321413

user output
(empty)

Test 4

Group: 3

Verdict:

input
100000 30000
29983
53806
76909
106815
...

correct output
100755932

user output
(empty)

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
20 10
126229031
250138471
333910089
443521720
...

correct output
537092323

user output
537092323

Test 6

Group: 2, 3

Verdict:

input
10000 4999
168328
266967
462469
639689
...

correct output
492516409

user output
(empty)

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
10 4
165
375
439
456
...

correct output
44

user output
44

Test 8

Group: 1, 2, 3

Verdict:

input
20 9
4336
4500
4552
4702
...

correct output
773

user output
885

Test 9

Group: 2, 3

Verdict:

input
2001 1000
1230
1440
1630
2230
...

correct output
493503

user output
(empty)

Test 10

Group: 2, 3

Verdict:

input
10000 3000
245408
417449
650973
863296
...

correct output
101056127

user output
(empty)

Test 11

Group: 3

Verdict:

input
50000 20000
37035
37042
37046
37052
...

correct output
129968

user output
(empty)

Test 12

Group: 3

Verdict:

input
99999 48000
15929
43928
65765
86730
...

correct output
375524431

user output
(empty)

Test 13

Group: 3

Verdict:

input
100000 1000
536
9214
34619
53734
...

correct output
75975

user output
(empty)

Test 14

Group: 1, 2, 3

Verdict: ACCEPTED

input
10 4
5851
5854
5856
5859
...

correct output
2664

user output
2664

Test 15

Group: 2, 3

Verdict:

input
100 45
3712
13742
17394
19428
...

correct output
140256

user output
157414

Test 16

Group: 3

Verdict:

input
20000 400
3174
3175
3176
3179
...

correct output
803105

user output
(empty)

Test 17

Group: 3

Verdict:

input
100000 49000
3605
14510
18001
20881
...

correct output
162316123

user output
(empty)

Test 18

Group: 2, 3

Verdict: ACCEPTED

input
100 50
0
1000000
1000002
1000005
...

correct output
1002499

user output
1002499

Test 19

Group: 2, 3

Verdict:

input
1000 500
0
1000000
1000002
1000005
...

correct output
1249999

user output
(empty)

Test 20

Group: 3

Verdict:

input
100000 49494
123
65659
98427
114811
...

correct output
250954854

user output
(empty)