oj.uz

Submission #79402

# Submission time Handle Problem Language Result Execution time Memory
79402 2018-10-13T06:29:57 Z Plurm Boxes with souvenirs (IOI15_boxes) C++11
100 / 100
 1270 ms 328824 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

long long delivery(int N, int K, int L, int p[]) {
	vector<long long> dp1,dp2;
	vector<long long> suf;
	dp1.resize(N);
	dp2.resize(N);
	dp1[0] = 2ll*p[0];
	for(int i = 1; i < N; i++){
		dp1[i] = i >= K ? dp1[i-K] : 0ll;
		dp1[i] += 2ll*(long long)p[i];
	}
	dp2[N-1] = 2ll*(long long)(L-p[N-1]);
	for(int i = N-2; i >= 0; i--){
		dp2[i] = i+K >= N ? 0ll : dp2[i+K];
		dp2[i] += 2ll*(long long)(L-p[i]);
	}
	long long mn = (long long)(N+K-1)/(long long)K*(long long)L;
	for(int i = 0; i < N; i++){
		mn = min(mn,dp1[i] + (long long)(N-i+K-2)/(long long)K*(long long)L);
		mn = min(mn,dp2[i] + (long long)(i+K-1)/(long long)K*(long long)L);
	}
	for(int i = 0; i < K; i++){
		for(int j = (N-i-1)/K; j >= 0; j--) suf.push_back(0);
		for(int j = (N-i-1)/K; j >= 0; j--){
			suf[j] = min((K*(j+1)+i >= N ? (long long)1e18 : suf[j+1]),dp2[K*j+i] + (long long)j*(long long)L);
		}
		for(int j = (N-i-1)/K; j >= 0; j--){
			mn = min(mn,dp1[i+j*K-1] + suf[j] - (long long)(i+j*K)/(long long)K*(long long)L);
		}
	}
		//for(int j = 0; i+1+j*K < N; j++){
		//	mn = min(mn,dp1[i] + dp2[i+1+j*K] + (long long)(j)*(long long)L);
		//}
	return mn;
}

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 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 348 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 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 #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 296 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 252 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 296 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 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 348 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 380 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 376 KB Output is correct
16 Correct 2 ms 296 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 252 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 296 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 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 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 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 348 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 380 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 376 KB Output is correct
16 Correct 2 ms 296 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 252 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 296 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 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 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 104 ms 28228 KB Output is correct
34 Correct 84 ms 28296 KB Output is correct
35 Correct 71 ms 28256 KB Output is correct
36 Correct 111 ms 28212 KB Output is correct
37 Correct 115 ms 28332 KB Output is correct
38 Correct 124 ms 28232 KB Output is correct
39 Correct 96 ms 28276 KB Output is correct
40 Correct 96 ms 28244 KB Output is correct
41 Correct 119 ms 28248 KB Output is correct
42 Correct 94 ms 28256 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 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 348 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 380 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 376 KB Output is correct
16 Correct 2 ms 296 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 252 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 296 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 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 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 104 ms 28228 KB Output is correct
34 Correct 84 ms 28296 KB Output is correct
35 Correct 71 ms 28256 KB Output is correct
36 Correct 111 ms 28212 KB Output is correct
37 Correct 115 ms 28332 KB Output is correct
38 Correct 124 ms 28232 KB Output is correct
39 Correct 96 ms 28276 KB Output is correct
40 Correct 96 ms 28244 KB Output is correct
41 Correct 119 ms 28248 KB Output is correct
42 Correct 94 ms 28256 KB Output is correct
43 Correct 1085 ms 327580 KB Output is correct
44 Correct 838 ms 327544 KB Output is correct
45 Correct 818 ms 328284 KB Output is correct
46 Correct 1093 ms 328488 KB Output is correct
47 Correct 1066 ms 328536 KB Output is correct
48 Correct 1270 ms 328724 KB Output is correct
49 Correct 975 ms 328588 KB Output is correct
50 Correct 908 ms 328484 KB Output is correct
51 Correct 1172 ms 328824 KB Output is correct
52 Correct 902 ms 328344 KB Output is correct