Submission #138829

# Submission time Handle Problem Language Result Execution time Memory
138829 2019-07-30T12:28:52 Z dnass Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
1079 ms 305972 KB
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long int lld;

int n, k, l;
vector<int> lhalf, rhalf;
int lsize, rsize;
vector<lld> beg_l, beg_r, new_beg_r;
lld min_new_beg_r_mod_k[10000002];

int myceil(int x, int y){
	if(x%y==0) return x/y;
	return (x/y)+1;
}

long long delivery(int N, int K, int L, int p[]){
	lld cost = 1e18;
	n = N; k = K; l = L;
	if(n==1) return min((lld)2*p[0], (lld)2*(l-p[0]));
	for(int i=0;i<n&&2*p[i]<=l;i++){
		lhalf.push_back(p[i]);
	}
	lsize = (int) lhalf.size();
	for(int i=n-1;i>=0&&2*(l-p[i])<l;i--){
		rhalf.push_back(l-p[i]);
	}
	rsize = (int) rhalf.size();
	beg_l.push_back(0);
	for(int i=0;i<lsize;i++){
		beg_l.push_back(2*((lld)lhalf[i])+beg_l[max(0, i-k+1)]);
	}
	beg_r.push_back(0);
	for(int i=0;i<rsize;i++){
		beg_r.push_back(2*((lld)rhalf[i])+beg_r[max(0, i-k+1)]);
	}
	cost = *beg_l.rbegin()+*beg_r.rbegin();
	for(int i=rsize;i>=0;i--){
		new_beg_r.push_back(beg_r[i]+(lld)myceil(rsize-i, k)*((lld) l));
	}
	/*
	for(auto x:beg_r) printf("%lld ", x);
		printf("\n");
	for(auto x:new_beg_r) printf("%lld ", x);
		printf("\n");
	for(auto x:beg_l) printf("%lld ", x);
		printf("\n");
		*/
	for(int i=0;i<k;i++){
		min_new_beg_r_mod_k[i] = 1e18;
	}
	for(int i=0;i<=rsize;i++){
		min_new_beg_r_mod_k[i%k] = min(min_new_beg_r_mod_k[i%k], new_beg_r[i]);
	}
	for(int i=lsize;i>=0;i--){
		cost = min(cost, ((lld)((lsize-i)/k))*((lld)l)+min_new_beg_r_mod_k[(k-((lsize-i)%k))%k]+beg_l[i]);
	}
	return cost;
}
# 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
# 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 380 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
# 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 380 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 376 KB Output is correct
# 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
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 380 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 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 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 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 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 312 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
# 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
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 380 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 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 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 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 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 312 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 81 ms 22136 KB Output is correct
34 Correct 50 ms 25264 KB Output is correct
35 Correct 52 ms 26048 KB Output is correct
36 Correct 92 ms 38224 KB Output is correct
37 Correct 89 ms 41688 KB Output is correct
38 Correct 78 ms 30304 KB Output is correct
39 Correct 75 ms 30376 KB Output is correct
40 Correct 57 ms 25812 KB Output is correct
41 Correct 89 ms 38096 KB Output is correct
42 Correct 70 ms 32208 KB Output is correct
# 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
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 380 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 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 380 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 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 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 312 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 81 ms 22136 KB Output is correct
34 Correct 50 ms 25264 KB Output is correct
35 Correct 52 ms 26048 KB Output is correct
36 Correct 92 ms 38224 KB Output is correct
37 Correct 89 ms 41688 KB Output is correct
38 Correct 78 ms 30304 KB Output is correct
39 Correct 75 ms 30376 KB Output is correct
40 Correct 57 ms 25812 KB Output is correct
41 Correct 89 ms 38096 KB Output is correct
42 Correct 70 ms 32208 KB Output is correct
43 Correct 898 ms 226580 KB Output is correct
44 Correct 498 ms 230300 KB Output is correct
45 Correct 688 ms 239708 KB Output is correct
46 Correct 809 ms 227616 KB Output is correct
47 Correct 848 ms 272932 KB Output is correct
48 Correct 1079 ms 305972 KB Output is correct
49 Correct 877 ms 236860 KB Output is correct
50 Correct 689 ms 229660 KB Output is correct
51 Correct 1078 ms 305532 KB Output is correct
52 Correct 812 ms 294708 KB Output is correct