oj.uz

Submission #82033

# Submission time Handle Problem Language Result Execution time Memory
82033 2018-10-28T13:47:07 Z farukkastamonuda Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 567 ms 171060 KB 
#include "boxes.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define lo long long 
#define inf 1000000000000000000
#define md 1000000007
#define li 10000005
#define mp make_pair
#define pb push_back
using namespace std;
vector<lo int> l,r;
lo int ans=inf;
long long delivery(int N,int K,int L,int positions[]){
	for(int i=0;i<N;i++){
		if(positions[i]<=L/2){
			l.pb(positions[i]*2);
		}
		else{
			r.pb(2*L-positions[i]*2);
		}
	}
	reverse(r.begin(),r.end());
	for(int i=K;i<(int)l.size();i++){
		l[i]+=l[i-K];
	}
	for(int i=K;i<(int)r.size();i++){
		r[i]+=r[i-K];
	}
	for(int i=0;i<=K;i++){
		int x=i;
		int y=K-i;
		ans=min(ans,(x<(int)l.size()?l[l.size()-1-x]:0)+(y<(int)r.size()?r[r.size()-1-y]:0)+L);
	}
	ans=min(ans,((int)l.size()>0?l.back():0)+((int)r.size()>0?r.back():0));
	return ans;
}

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 296 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 2 ms 276 KB Output is correct

Subtask #2
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 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 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 380 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 3 ms 256 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 256 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 296 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 2 ms 276 KB Output is correct
8 Correct 2 ms 256 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 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 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 380 KB Output is correct
17 Correct 2 ms 252 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 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 292 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 420 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 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 296 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 2 ms 276 KB Output is correct
8 Correct 2 ms 256 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 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 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 380 KB Output is correct
17 Correct 2 ms 252 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 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 292 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 420 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 50 ms 14240 KB Output is correct
34 Correct 29 ms 16188 KB Output is correct
35 Correct 29 ms 16132 KB Output is correct
36 Correct 50 ms 12612 KB Output is correct
37 Correct 50 ms 12708 KB Output is correct
38 Correct 58 ms 14164 KB Output is correct
39 Correct 46 ms 14276 KB Output is correct
40 Correct 30 ms 14404 KB Output is correct
41 Correct 54 ms 12612 KB Output is correct
42 Correct 31 ms 12612 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 296 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 296 KB Output is correct
7 Correct 2 ms 276 KB Output is correct
8 Correct 2 ms 256 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 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 256 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 380 KB Output is correct
17 Correct 2 ms 252 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 256 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 292 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 3 ms 420 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 348 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 50 ms 14240 KB Output is correct
34 Correct 29 ms 16188 KB Output is correct
35 Correct 29 ms 16132 KB Output is correct
36 Correct 50 ms 12612 KB Output is correct
37 Correct 50 ms 12708 KB Output is correct
38 Correct 58 ms 14164 KB Output is correct
39 Correct 46 ms 14276 KB Output is correct
40 Correct 30 ms 14404 KB Output is correct
41 Correct 54 ms 12612 KB Output is correct
42 Correct 31 ms 12612 KB Output is correct
43 Correct 543 ms 144448 KB Output is correct
44 Correct 256 ms 135672 KB Output is correct
45 Correct 332 ms 145940 KB Output is correct
46 Correct 538 ms 170968 KB Output is correct
47 Correct 519 ms 119936 KB Output is correct
48 Correct 567 ms 170968 KB Output is correct
49 Correct 512 ms 144356 KB Output is correct
50 Correct 356 ms 144412 KB Output is correct
51 Correct 567 ms 170980 KB Output is correct
52 Correct 356 ms 171060 KB Output is correct