Submission #976816

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
976816	2024-05-07T07:00:35 Z	Amaarsaa	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	566 ms	293768 KB

boxes

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

ll delivery(int N,int K, int L, int p[]) {
	ll ans, cnt_ard, cnt_urd, res, i;
	ll Pre[N + 2], Suf[N + 2];
	Pre[0] = Suf[0] = 0;
	for (i = 1; i <= N; i ++) {
		Suf[i] = Suf[max(i - K, 0ll)] + p[i- 1] * 2;
		Pre[i] = Pre[max(i - K, 0ll)] + (L - p[N - i]) * 2;
	}
	ans = 1e18;
	for (i = 0; i <= N; i ++) {
		ans = min(ans, Pre[i] + min(Suf[N - i], Suf[max(N - i - K, 0ll)] + L));
	}
	return ans ;
	
}

Compilation message

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:7:10: warning: unused variable 'cnt_ard' [-Wunused-variable]
    7 |  ll ans, cnt_ard, cnt_urd, res, i;
      |          ^~~~~~~
boxes.cpp:7:19: warning: unused variable 'cnt_urd' [-Wunused-variable]
    7 |  ll ans, cnt_ard, cnt_urd, res, i;
      |                   ^~~~~~~
boxes.cpp:7:28: warning: unused variable 'res' [-Wunused-variable]
    7 |  ll ans, cnt_ard, cnt_urd, res, i;
      |                            ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

#	Verdict	Memory	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	344 KB	Output is correct
6	Correct	436 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	408 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	436 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	436 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	51 ms	24976 KB	Output is correct
34	Correct	22 ms	21848 KB	Output is correct
35	Correct	23 ms	22356 KB	Output is correct
36	Correct	49 ms	29784 KB	Output is correct
37	Correct	47 ms	29736 KB	Output is correct
38	Correct	48 ms	29760 KB	Output is correct
39	Correct	42 ms	28240 KB	Output is correct
40	Correct	25 ms	23520 KB	Output is correct
41	Correct	45 ms	29740 KB	Output is correct
42	Correct	25 ms	23796 KB	Output is correct

Subtask #6
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	344 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	408 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	344 KB	Output is correct
20	Correct	0 ms	436 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	436 KB	Output is correct
26	Correct	1 ms	348 KB	Output is correct
27	Correct	1 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	51 ms	24976 KB	Output is correct
34	Correct	22 ms	21848 KB	Output is correct
35	Correct	23 ms	22356 KB	Output is correct
36	Correct	49 ms	29784 KB	Output is correct
37	Correct	47 ms	29736 KB	Output is correct
38	Correct	48 ms	29760 KB	Output is correct
39	Correct	42 ms	28240 KB	Output is correct
40	Correct	25 ms	23520 KB	Output is correct
41	Correct	45 ms	29740 KB	Output is correct
42	Correct	25 ms	23796 KB	Output is correct
43	Correct	566 ms	292464 KB	Output is correct
44	Correct	217 ms	215548 KB	Output is correct
45	Correct	258 ms	223412 KB	Output is correct
46	Correct	484 ms	293540 KB	Output is correct
47	Correct	453 ms	293768 KB	Output is correct
48	Correct	453 ms	293752 KB	Output is correct
49	Correct	404 ms	278764 KB	Output is correct
50	Correct	256 ms	232304 KB	Output is correct
51	Correct	452 ms	293536 KB	Output is correct
52	Correct	249 ms	235008 KB	Output is correct

Submission #976816

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