Submission #59173

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
59173	2018-07-20T22:04:03 Z	TadijaSebez	Boxes with souvenirs (IOI15_boxes)	C++11	100 / 100	513 ms	235340 KB

boxes

#include <stdio.h>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
const int N=10000050;
const ll inf=1e18;
ll l[N],r[N];
ll min(ll a, ll b){ return a>b?b:a;}
ll max(ll a, ll b){ return a>b?a:b;}
int x[N];
ll delivery(int n, int k, int sz, int v[])
{
	int i;
	//scanf("%i %i %i",&n,&k,&sz);
	for(i=1;i<=n;i++) x[i]=v[i-1];//scanf("%i",&x[i]);
	for(i=1;i<=n;i++) l[i]=l[max(i-k,0)]+(ll)2*x[i];
	for(i=n;i>=1;i--) r[i]=r[min(i+k,n+1)]+(ll)2*(sz-x[i]);
	ll sol=inf;
	if(n<=k) sol=sz;
	for(i=0;i<=n;i++) sol=min(sol,l[i]+r[i+1]);
	for(i=0;i<=n;i++) sol=min(sol,l[i]+r[min(i+k+1,n+1)]+sz);
	//printf("%lld\n",sol);
	return sol;
}

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 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	1 ms	296 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	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 #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	256 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	256 KB	Output is correct
6	Correct	2 ms	256 KB	Output is correct
7	Correct	2 ms	256 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	256 KB	Output is correct
2	Correct	2 ms	376 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	1 ms	296 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	2 ms	376 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	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	348 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	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	380 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	256 KB	Output is correct
2	Correct	2 ms	376 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	1 ms	296 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	2 ms	376 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	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	348 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	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	380 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	51 ms	23800 KB	Output is correct
34	Correct	30 ms	23800 KB	Output is correct
35	Correct	29 ms	23800 KB	Output is correct
36	Correct	56 ms	23864 KB	Output is correct
37	Correct	59 ms	23864 KB	Output is correct
38	Correct	53 ms	23772 KB	Output is correct
39	Correct	48 ms	23816 KB	Output is correct
40	Correct	32 ms	23800 KB	Output is correct
41	Correct	52 ms	23860 KB	Output is correct
42	Correct	33 ms	23800 KB	Output is correct

Subtask #6
30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	256 KB	Output is correct
2	Correct	2 ms	376 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	1 ms	296 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	2 ms	376 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	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	256 KB	Output is correct
18	Correct	2 ms	256 KB	Output is correct
19	Correct	2 ms	256 KB	Output is correct
20	Correct	2 ms	256 KB	Output is correct
21	Correct	2 ms	256 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	348 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	376 KB	Output is correct
29	Correct	2 ms	376 KB	Output is correct
30	Correct	2 ms	380 KB	Output is correct
31	Correct	2 ms	376 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	51 ms	23800 KB	Output is correct
34	Correct	30 ms	23800 KB	Output is correct
35	Correct	29 ms	23800 KB	Output is correct
36	Correct	56 ms	23864 KB	Output is correct
37	Correct	59 ms	23864 KB	Output is correct
38	Correct	53 ms	23772 KB	Output is correct
39	Correct	48 ms	23816 KB	Output is correct
40	Correct	32 ms	23800 KB	Output is correct
41	Correct	52 ms	23860 KB	Output is correct
42	Correct	33 ms	23800 KB	Output is correct
43	Correct	513 ms	235188 KB	Output is correct
44	Correct	264 ms	235268 KB	Output is correct
45	Correct	294 ms	235340 KB	Output is correct
46	Correct	512 ms	235108 KB	Output is correct
47	Correct	510 ms	235180 KB	Output is correct
48	Correct	507 ms	235140 KB	Output is correct
49	Correct	462 ms	235172 KB	Output is correct
50	Correct	321 ms	235156 KB	Output is correct
51	Correct	506 ms	235156 KB	Output is correct
52	Correct	333 ms	235168 KB	Output is correct

Submission #59173

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