Submission #297698

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
297698	2020-09-11T19:01:35 Z	maximath_1	Boxes with souvenirs (IOI15_boxes)	C++11	100 / 100	537 ms	213752 KB

boxes

#include "boxes.h"
#include <algorithm>
using namespace std;

long long tmp = 0ll, pref[10000005], suff[10000005];

long long delivery(int N, int K, int L, int p[]) {
	for(int i = 1; i <= N; i ++){
		pref[i] = min(p[i - 1] << 1, L);
		if(i > K) pref[i] += pref[i - K];
	}

	for(int i = N - 1; i >= 0; i --){
		suff[i] = min((L - p[i]) << 1, L);
		if(N - i > K) suff[i] += suff[i + K];
	}

	long long ans = pref[N];
	for(int i = 0; i < N; i ++)
		ans = min(ans, pref[i] + suff[i]);

    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

#	Verdict	Memory	Grader output
1	Correct	256 KB	Output is correct
2	Correct	256 KB	Output is correct
3	Correct	256 KB	Output is correct
4	Correct	384 KB	Output is correct
5	Correct	256 KB	Output is correct
6	Correct	256 KB	Output is correct
7	Correct	256 KB	Output is correct
8	Correct	256 KB	Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	0 ms	256 KB	Output is correct
23	Correct	0 ms	384 KB	Output is correct
24	Correct	0 ms	256 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	512 KB	Output is correct
28	Correct	0 ms	384 KB	Output is correct
29	Correct	0 ms	384 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct
33	Correct	57 ms	29688 KB	Output is correct
34	Correct	24 ms	21888 KB	Output is correct
35	Correct	26 ms	22264 KB	Output is correct
36	Correct	60 ms	29688 KB	Output is correct
37	Correct	57 ms	29688 KB	Output is correct
38	Correct	60 ms	29688 KB	Output is correct
39	Correct	53 ms	28156 KB	Output is correct
40	Correct	30 ms	23552 KB	Output is correct
41	Correct	59 ms	29688 KB	Output is correct
42	Correct	32 ms	23808 KB	Output is correct

Subtask #6
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	256 KB	Output is correct
2	Correct	1 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	1 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	0 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	0 ms	384 KB	Output is correct
15	Correct	0 ms	256 KB	Output is correct
16	Correct	0 ms	256 KB	Output is correct
17	Correct	0 ms	256 KB	Output is correct
18	Correct	0 ms	384 KB	Output is correct
19	Correct	0 ms	256 KB	Output is correct
20	Correct	0 ms	256 KB	Output is correct
21	Correct	0 ms	256 KB	Output is correct
22	Correct	0 ms	256 KB	Output is correct
23	Correct	0 ms	384 KB	Output is correct
24	Correct	0 ms	256 KB	Output is correct
25	Correct	0 ms	384 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	512 KB	Output is correct
28	Correct	0 ms	384 KB	Output is correct
29	Correct	0 ms	384 KB	Output is correct
30	Correct	0 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	0 ms	384 KB	Output is correct
33	Correct	57 ms	29688 KB	Output is correct
34	Correct	24 ms	21888 KB	Output is correct
35	Correct	26 ms	22264 KB	Output is correct
36	Correct	60 ms	29688 KB	Output is correct
37	Correct	57 ms	29688 KB	Output is correct
38	Correct	60 ms	29688 KB	Output is correct
39	Correct	53 ms	28156 KB	Output is correct
40	Correct	30 ms	23552 KB	Output is correct
41	Correct	59 ms	29688 KB	Output is correct
42	Correct	32 ms	23808 KB	Output is correct
43	Correct	521 ms	209656 KB	Output is correct
44	Correct	215 ms	203512 KB	Output is correct
45	Correct	244 ms	197368 KB	Output is correct
46	Correct	528 ms	209784 KB	Output is correct
47	Correct	537 ms	209692 KB	Output is correct
48	Correct	524 ms	209784 KB	Output is correct
49	Correct	469 ms	206276 KB	Output is correct
50	Correct	289 ms	212088 KB	Output is correct
51	Correct	537 ms	209872 KB	Output is correct
52	Correct	302 ms	213752 KB	Output is correct

Submission #297698

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