Submission #645018

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
645018	2022-09-25T23:27:38 Z	as111	Boxes with souvenirs (IOI15_boxes)	C++14	100 / 100	551 ms	278328 KB

boxes

#include "boxes.h"

#include <set>

#define MAXN 10000000

using namespace std;

long long dp1[MAXN + 5]; // clockwise, 1 based
long long dp2[MAXN + 5]; // counterclockwise
long long delivery(int N, int K, int L, int p[]) {
	dp1[0] = 0;
	for (int i = 1; i <= N; i++) { // to the left
		int prev = max(0, i - K);
		dp1[i] = dp1[prev] + min(L - p[i - 1], p[i - 1]); // prev here refers to team before the K
		if (prev == 0) {
			dp1[i] += p[i - 1];
		}
		else {
			dp1[i] += p[i - 1] - p[prev] + min(L - p[prev], p[prev]); // prev here refers to part of the K
		}
		
	}
	dp2[N+1] = 0;
	for (int i = N; i >=0; i--) { // to the right
		int prev = min(N + 1, i + K);
		dp2[i] = dp2[prev] + min(L - p[i - 1], p[i - 1]);
		if (prev == N + 1) {
			dp2[i] += L - p[i - 1];
		}
		else {
			dp2[i] += p[prev - 2] - p[i - 1] + min(L - p[prev - 2], p[prev - 2]);
		}
	}
	long long ans = 10e16;
	for (int i = 0; i <= N; i++) {
		ans = min(ans, dp1[i] + dp2[i + 1]);
	}
	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	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	296 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

Subtask #2

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	1 ms	212 KB	Output is correct
4	Correct	1 ms	300 KB	Output is correct
5	Correct	0 ms	304 KB	Output is correct
6	Correct	1 ms	300 KB	Output is correct
7	Correct	0 ms	292 KB	Output is correct

Subtask #3

15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	292 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	292 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	296 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	1 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	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	296 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
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	0 ms	304 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	0 ms	292 KB	Output is correct
15	Correct	0 ms	292 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	292 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	296 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	308 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	300 KB	Output is correct
28	Correct	0 ms	300 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	296 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	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	296 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
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	0 ms	304 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	0 ms	292 KB	Output is correct
15	Correct	0 ms	292 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	292 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	296 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	308 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	300 KB	Output is correct
28	Correct	0 ms	300 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	296 KB	Output is correct
33	Correct	55 ms	29468 KB	Output is correct
34	Correct	26 ms	21740 KB	Output is correct
35	Correct	24 ms	22308 KB	Output is correct
36	Correct	55 ms	29636 KB	Output is correct
37	Correct	52 ms	29688 KB	Output is correct
38	Correct	51 ms	29644 KB	Output is correct
39	Correct	45 ms	28112 KB	Output is correct
40	Correct	27 ms	23436 KB	Output is correct
41	Correct	52 ms	29624 KB	Output is correct
42	Correct	28 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	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	296 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
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	300 KB	Output is correct
12	Correct	0 ms	304 KB	Output is correct
13	Correct	1 ms	300 KB	Output is correct
14	Correct	0 ms	292 KB	Output is correct
15	Correct	0 ms	292 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	292 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	296 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	308 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	300 KB	Output is correct
28	Correct	0 ms	300 KB	Output is correct
29	Correct	0 ms	340 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	296 KB	Output is correct
33	Correct	55 ms	29468 KB	Output is correct
34	Correct	26 ms	21740 KB	Output is correct
35	Correct	24 ms	22308 KB	Output is correct
36	Correct	55 ms	29636 KB	Output is correct
37	Correct	52 ms	29688 KB	Output is correct
38	Correct	51 ms	29644 KB	Output is correct
39	Correct	45 ms	28112 KB	Output is correct
40	Correct	27 ms	23436 KB	Output is correct
41	Correct	52 ms	29624 KB	Output is correct
42	Correct	28 ms	23684 KB	Output is correct
43	Correct	531 ms	273416 KB	Output is correct
44	Correct	213 ms	215540 KB	Output is correct
45	Correct	237 ms	223260 KB	Output is correct
46	Correct	534 ms	277272 KB	Output is correct
47	Correct	539 ms	274448 KB	Output is correct
48	Correct	531 ms	274508 KB	Output is correct
49	Correct	461 ms	278328 KB	Output is correct
50	Correct	304 ms	232436 KB	Output is correct
51	Correct	551 ms	274352 KB	Output is correct
52	Correct	290 ms	235084 KB	Output is correct