CSES - APIO 2007 - Results
Submission details
Task:Backup
Sender:Katajisto
Submission time:2019-03-07 14:15:30 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.01 s1, 2, 3details
#20.03 s1, 2, 3details
#30.07 s3details
#40.06 s3details
#50.02 s1, 2, 3details
#60.06 s2, 3details
#70.02 s1, 2, 3details
#80.02 s1, 2, 3details
#90.12 s2, 3details
#100.06 s2, 3details
#110.07 s3details
#120.07 s3details
#130.08 s3details
#140.02 s1, 2, 3details
#150.01 s2, 3details
#160.07 s3details
#170.07 s3details
#180.02 s2, 3details
#190.05 s2, 3details
#200.08 s3details

Code

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

int n,k;

vector<pair<int,int>> vp;

long long dm = 1e12;

long long d[21];

void gen(int i,int c, long long p) {
  if(i >= n) return;
  if(p >= dm) return;
  if(c == k) {
    dm = min(dm,p);
    return;
  }
  gen(i+1,c+1,p+d[i]);
  gen(i+1,c,p);
}

int main() {
  cin >> n;
  cin >> k;
  for(int i = 0; i < n; i++) {
    for(int j = i+1; j < n; j++) {
      vp.push_back({i,j});
    }
  }
  sort(vp.begin(), vp.end());
  for(int i = 0; i < n; i++) cin >> d[i];
  gen(0,0,0);
  cout << dm << "\n";
}

Test details

Test 1

Group: 1, 2, 3

Verdict:

input
2 1
0
1000000000

correct output
1000000000

user output
0

Test 2

Group: 1, 2, 3

Verdict:

input
17 8
101266
101394
101458
101490
...

correct output
340

user output
811666

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:

input
20 10
126229031
250138471
333910089
443521720
...

correct output
537092323

user output
4873026108

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:

input
10 4
165
375
439
456
...

correct output
44

user output
1435

Test 8

Group: 1, 2, 3

Verdict:

input
20 9
4336
4500
4552
4702
...

correct output
773

user output
42388

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:

input
10 4
5851
5854
5856
5859
...

correct output
2664

user output
23420

Test 15

Group: 2, 3

Verdict:

input
100 45
3712
13742
17394
19428
...

correct output
140256

user output
(empty)

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:

input
100 50
0
1000000
1000002
1000005
...

correct output
1002499

user output
(empty)

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)