Submission #791795

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
791795	2023-07-24T10:07:56 Z	jasmin	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	479 ms	293852 KB

boxes

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

const long long INF=LLONG_MAX;

long long delivery(int n, int k, int l, int p[]) {
    
    vector<long long> left(n+1);
    left[0]=0;
    for(int i=0; i<n; i++){

        long long distance = min(p[i], l-p[i]);
        left[i+1] = left[max(0, i+1-k)] + distance + p[i];
    }

    vector<long long> right(n+1);
    right[0]=0;
    for(int i=0; i<n; i++){

        long long distance = min(p[n-1-i], l-p[n-1-i]);
        right[i+1] = right[max(0, i+1-k)] + distance + l-p[n-1-i];
    }


    long long ans=INF;
    for(int i=0; i<=n; i++){

        ans = min(ans, left[i] + right[n-i]);
    }

    return ans;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	300 KB	Output is correct
4	Correct	1 ms	304 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	336 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct
5	Correct	212 KB	Output is correct
6	Correct	212 KB	Output is correct
7	Correct	212 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct

Subtask #4
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	300 KB	Output is correct
4	Correct	1 ms	304 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	308 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	312 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	300 KB	Output is correct
4	Correct	1 ms	304 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	308 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	312 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	45 ms	29544 KB	Output is correct
34	Correct	17 ms	21752 KB	Output is correct
35	Correct	22 ms	22232 KB	Output is correct
36	Correct	44 ms	29628 KB	Output is correct
37	Correct	44 ms	29584 KB	Output is correct
38	Correct	45 ms	29596 KB	Output is correct
39	Correct	40 ms	28060 KB	Output is correct
40	Correct	24 ms	23432 KB	Output is correct
41	Correct	47 ms	29672 KB	Output is correct
42	Correct	26 ms	23684 KB	Output is correct

Subtask #6
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	300 KB	Output is correct
4	Correct	1 ms	304 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	256 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	336 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	308 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	312 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	45 ms	29544 KB	Output is correct
34	Correct	17 ms	21752 KB	Output is correct
35	Correct	22 ms	22232 KB	Output is correct
36	Correct	44 ms	29628 KB	Output is correct
37	Correct	44 ms	29584 KB	Output is correct
38	Correct	45 ms	29596 KB	Output is correct
39	Correct	40 ms	28060 KB	Output is correct
40	Correct	24 ms	23432 KB	Output is correct
41	Correct	47 ms	29672 KB	Output is correct
42	Correct	26 ms	23684 KB	Output is correct
43	Correct	444 ms	292688 KB	Output is correct
44	Correct	167 ms	215480 KB	Output is correct
45	Correct	202 ms	223352 KB	Output is correct
46	Correct	440 ms	293852 KB	Output is correct
47	Correct	447 ms	293744 KB	Output is correct
48	Correct	479 ms	293720 KB	Output is correct
49	Correct	426 ms	278380 KB	Output is correct
50	Correct	246 ms	232408 KB	Output is correct
51	Correct	470 ms	293452 KB	Output is correct
52	Correct	249 ms	235056 KB	Output is correct

Submission #791795

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 15.0 / 15.0

Subtask #5 20.0 / 20.0

Subtask #6 30.0 / 30.0

Subtask #1
10.0 / 10.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
15.0 / 15.0

Subtask #5
20.0 / 20.0

Subtask #6
30.0 / 30.0