Submission #59174

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
59174	2018-07-20T22:04:38 Z	TadijaSebez	Boxes with souvenirs (IOI15_boxes)	C++11	100 / 100	540 ms	235256 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	1 ms	256 KB	Output is correct
2	Correct	2 ms	292 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	380 KB	Output is correct

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	348 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	276 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	1 ms	256 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	348 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	1 ms	256 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct

Subtask #4
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	2 ms	292 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	380 KB	Output is correct
8	Correct	2 ms	348 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	276 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	1 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	376 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	292 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	1 ms	256 KB	Output is correct
2	Correct	2 ms	292 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	380 KB	Output is correct
8	Correct	2 ms	348 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	276 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	1 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	376 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	292 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	51 ms	23800 KB	Output is correct
34	Correct	27 ms	23800 KB	Output is correct
35	Correct	28 ms	23800 KB	Output is correct
36	Correct	53 ms	23856 KB	Output is correct
37	Correct	58 ms	23804 KB	Output is correct
38	Correct	52 ms	23772 KB	Output is correct
39	Correct	59 ms	23848 KB	Output is correct
40	Correct	33 ms	23804 KB	Output is correct
41	Correct	52 ms	23804 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	1 ms	256 KB	Output is correct
2	Correct	2 ms	292 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	380 KB	Output is correct
8	Correct	2 ms	348 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	276 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	348 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	2 ms	376 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	1 ms	256 KB	Output is correct
23	Correct	1 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	376 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	292 KB	Output is correct
32	Correct	2 ms	376 KB	Output is correct
33	Correct	51 ms	23800 KB	Output is correct
34	Correct	27 ms	23800 KB	Output is correct
35	Correct	28 ms	23800 KB	Output is correct
36	Correct	53 ms	23856 KB	Output is correct
37	Correct	58 ms	23804 KB	Output is correct
38	Correct	52 ms	23772 KB	Output is correct
39	Correct	59 ms	23848 KB	Output is correct
40	Correct	33 ms	23804 KB	Output is correct
41	Correct	52 ms	23804 KB	Output is correct
42	Correct	33 ms	23800 KB	Output is correct
43	Correct	522 ms	235100 KB	Output is correct
44	Correct	266 ms	235084 KB	Output is correct
45	Correct	290 ms	235132 KB	Output is correct
46	Correct	540 ms	235092 KB	Output is correct
47	Correct	531 ms	235188 KB	Output is correct
48	Correct	506 ms	235136 KB	Output is correct
49	Correct	465 ms	235208 KB	Output is correct
50	Correct	318 ms	235256 KB	Output is correct
51	Correct	509 ms	235208 KB	Output is correct
52	Correct	348 ms	235100 KB	Output is correct

Submission #59174

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