Submission #69909

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
69909	2018-08-22T00:13:34 Z	MatheusLealV	Boxes with souvenirs (IOI15_boxes)	C++17	100 / 100	548 ms	235320 KB

boxes

#include <bits/stdc++.h>
#define N 10000002
using namespace std;
typedef long long ll;

int n, k, l, pos[N];

ll L[N], R[N], ans = 200000000000000000;

ll delivery(int N_, int K_, int L_, int positions[])
{
	n = N_, k = K_, l = L_;

	for(int i = 1; i <= n; i++) pos[i] = positions[i - 1];

	for(int i = 1; i <= n; i++)
	{
		if(i <= k) L[i] = 2LL*(ll)pos[i];

		else L[i] = L[i - k] + 2LL*(ll)pos[i];
	}

	for(int i = n; i >= 1; i--)
	{
		if(n - i + 1 <= k) R[i] = 2LL*((ll)l - (ll)pos[i]);

		else R[i] = R[i + k] + 2LL*((ll)l -(ll) pos[i]);
	}

	ll d1 = min(pos[1], l - pos[1]), dn = min(pos[n], l - pos[n]);

	ans = min((ll)R[1] - ((ll)l - (ll)pos[1]) + (ll)d1, (ll)L[n] - (ll)pos[n] + dn);

	for(int i = 1; i < n; i++)
	{
		ll di = min(pos[i], l - pos[i]);

		ll dii = min(pos[i + 1], l - pos[i + 1]);

		ll A = (ll)L[i] - (ll)pos[i] + (ll)di;

		ll B =(ll) R[i + 1] - ((ll)l - (ll)pos[i + 1]) + dii;

		ans = min(ans, A + B);
	}

	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	3 ms	380 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	380 KB	Output is correct
19	Correct	2 ms	380 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	380 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	54 ms	23792 KB	Output is correct
34	Correct	30 ms	23800 KB	Output is correct
35	Correct	34 ms	23880 KB	Output is correct
36	Correct	56 ms	23872 KB	Output is correct
37	Correct	52 ms	23800 KB	Output is correct
38	Correct	54 ms	23900 KB	Output is correct
39	Correct	51 ms	23868 KB	Output is correct
40	Correct	35 ms	23800 KB	Output is correct
41	Correct	56 ms	23876 KB	Output is correct
42	Correct	40 ms	23924 KB	Output is correct

Subtask #6
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	380 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	376 KB	Output is correct
5	Correct	2 ms	376 KB	Output is correct
6	Correct	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	2 ms	376 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	3 ms	380 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	348 KB	Output is correct
17	Correct	2 ms	376 KB	Output is correct
18	Correct	2 ms	380 KB	Output is correct
19	Correct	2 ms	380 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	2 ms	376 KB	Output is correct
27	Correct	2 ms	376 KB	Output is correct
28	Correct	2 ms	380 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	376 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	54 ms	23792 KB	Output is correct
34	Correct	30 ms	23800 KB	Output is correct
35	Correct	34 ms	23880 KB	Output is correct
36	Correct	56 ms	23872 KB	Output is correct
37	Correct	52 ms	23800 KB	Output is correct
38	Correct	54 ms	23900 KB	Output is correct
39	Correct	51 ms	23868 KB	Output is correct
40	Correct	35 ms	23800 KB	Output is correct
41	Correct	56 ms	23876 KB	Output is correct
42	Correct	40 ms	23924 KB	Output is correct
43	Correct	545 ms	235128 KB	Output is correct
44	Correct	318 ms	235132 KB	Output is correct
45	Correct	323 ms	235100 KB	Output is correct
46	Correct	548 ms	235168 KB	Output is correct
47	Correct	541 ms	235320 KB	Output is correct
48	Correct	536 ms	235080 KB	Output is correct
49	Correct	492 ms	235196 KB	Output is correct
50	Correct	319 ms	235152 KB	Output is correct
51	Correct	541 ms	235132 KB	Output is correct
52	Correct	392 ms	235180 KB	Output is correct

Submission #69909

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