답안 #129191

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
129191	2019-07-11T19:49:45 Z	joseacaz	선물상자 (IOI15_boxes)	C++17	50 / 100	2000 ms	17872 KB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define MAXN 1000006
#define INF (1LL << 62LL)

using namespace std;
typedef long long ll;

int N, K, L, lbound;
ll DP[MAXN], pre[MAXN], cost;
vector < int > P;

ll delivery ( int _n, int _k, int _l, int _p[] )
{
	N = _n, K = _k, L = _l;
	P.push_back ( 0 );
	for ( int i = 0; i < N; i++ )
		P.push_back ( _p[i] );
	P.push_back ( L );
	
	for ( int i = 1; i <= N + 1; i++ )
	{
		pre[i] = pre[i - 1] + (P[i] - P[i - 1]);
		if ( 2 * P[i] < L )
			lbound = i;
	}
	
	for ( int i = N; i >= 1; i-- )
	{
		DP[i] = INF;
		for ( int k = 1; k <= K; k++ )
		{
			if ( i + k <= N + 1 )
			{
				if ( i + k - 1 <= lbound )
					cost = 2 * pre[i + k - 1];
				else
					cost = min ( (ll)L, 2 * (pre[N + 1] - pre[i]) );
				DP[i] = min ( DP[i], cost + DP[i + k] );
			}
		}
	}

	return DP[1];
}

Subtask #1

10.0 / 10.0

#	결과	실행 시간	메모리	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	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	4 ms	376 KB	Output is correct
2	Correct	4 ms	376 KB	Output is correct
3	Correct	4 ms	376 KB	Output is correct
4	Correct	4 ms	376 KB	Output is correct
5	Correct	4 ms	376 KB	Output is correct
6	Correct	4 ms	376 KB	Output is correct
7	Correct	4 ms	376 KB	Output is correct

Subtask #3

15.0 / 15.0

#	결과	실행 시간	메모리	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	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

#	결과	실행 시간	메모리	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	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	4 ms	376 KB	Output is correct
9	Correct	4 ms	376 KB	Output is correct
10	Correct	4 ms	376 KB	Output is correct
11	Correct	4 ms	376 KB	Output is correct
12	Correct	4 ms	376 KB	Output is correct
13	Correct	4 ms	376 KB	Output is correct
14	Correct	4 ms	376 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 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	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	4 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	376 KB	Output is correct
29	Correct	4 ms	376 KB	Output is correct
30	Correct	4 ms	376 KB	Output is correct
31	Correct	4 ms	376 KB	Output is correct
32	Correct	4 ms	376 KB	Output is correct

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	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	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	4 ms	376 KB	Output is correct
9	Correct	4 ms	376 KB	Output is correct
10	Correct	4 ms	376 KB	Output is correct
11	Correct	4 ms	376 KB	Output is correct
12	Correct	4 ms	376 KB	Output is correct
13	Correct	4 ms	376 KB	Output is correct
14	Correct	4 ms	376 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 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	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	4 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	376 KB	Output is correct
29	Correct	4 ms	376 KB	Output is correct
30	Correct	4 ms	376 KB	Output is correct
31	Correct	4 ms	376 KB	Output is correct
32	Correct	4 ms	376 KB	Output is correct
33	Execution timed out	2051 ms	17872 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	결과	실행 시간	메모리	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	2 ms	376 KB	Output is correct
7	Correct	2 ms	376 KB	Output is correct
8	Correct	4 ms	376 KB	Output is correct
9	Correct	4 ms	376 KB	Output is correct
10	Correct	4 ms	376 KB	Output is correct
11	Correct	4 ms	376 KB	Output is correct
12	Correct	4 ms	376 KB	Output is correct
13	Correct	4 ms	376 KB	Output is correct
14	Correct	4 ms	376 KB	Output is correct
15	Correct	2 ms	256 KB	Output is correct
16	Correct	2 ms	376 KB	Output is correct
17	Correct	2 ms	376 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	2 ms	376 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	4 ms	376 KB	Output is correct
24	Correct	3 ms	376 KB	Output is correct
25	Correct	2 ms	376 KB	Output is correct
26	Correct	3 ms	376 KB	Output is correct
27	Correct	3 ms	376 KB	Output is correct
28	Correct	3 ms	376 KB	Output is correct
29	Correct	4 ms	376 KB	Output is correct
30	Correct	4 ms	376 KB	Output is correct
31	Correct	4 ms	376 KB	Output is correct
32	Correct	4 ms	376 KB	Output is correct
33	Execution timed out	2051 ms	17872 KB	Time limit exceeded
34	Halted	0 ms	0 KB	-