oj.uz

Submission #119725

# Submission time Handle Problem Language Result Execution time Memory
119725 2019-06-22T02:12:14 Z nxteru Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 455 ms 137912 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1000000000000000000
int n,k,l,m=-1;
ll x[5000005],y[5000005],q[10000005],ans=INF;
long long delivery(int N, int K, int L, int p[]) {
    n=N,k=K,l=L;
    for(int i=1;i<=n;i++){
		q[i]=p[i-1];
		if(m==-1&&p[i-1]>l/2)m=i;
	}
	q[n+1]=l;
	if(m==-1)m=n+1;
	n+=2;
    for(int i=m-1;i>=0;i-=k){
		x[0]+=q[i]*2LL;
	}
	int r=0;
	for(int i=m-2;i>=0;i--){
		x[r%k+1]-=(q[i+1]-q[i])*2LL;
		r++;
	}
	for(int i=1;i<=k;i++){
		x[i]+=x[i-1];
	}
	for(int i=m;i<n;i+=k){
		y[0]+=(l-q[i])*2LL;
	}
	r=0;
	for(int i=m+1;i<n;i++){
		y[r%k+1]-=(q[i]-q[i-1])*2LL;
		r++;
	}
	for(int i=1;i<=k;i++){
		y[i]+=y[i-1];
	}
	ans=x[0]+y[0];
	for(int i=0;i<=k;i++){
		ans=min(ans,ll(l)+x[i]+y[k-i]);
	}
	return ans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 304 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 2 ms 316 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 2 ms 316 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 47 ms 21852 KB Output is correct
34 Correct 22 ms 14052 KB Output is correct
35 Correct 58 ms 14472 KB Output is correct
36 Correct 51 ms 21880 KB Output is correct
37 Correct 46 ms 21880 KB Output is correct
38 Correct 51 ms 21880 KB Output is correct
39 Correct 41 ms 20344 KB Output is correct
40 Correct 46 ms 15736 KB Output is correct
41 Correct 48 ms 21880 KB Output is correct
42 Correct 27 ms 15992 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 304 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 2 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 2 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 2 ms 316 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 47 ms 21852 KB Output is correct
34 Correct 22 ms 14052 KB Output is correct
35 Correct 58 ms 14472 KB Output is correct
36 Correct 51 ms 21880 KB Output is correct
37 Correct 46 ms 21880 KB Output is correct
38 Correct 51 ms 21880 KB Output is correct
39 Correct 41 ms 20344 KB Output is correct
40 Correct 46 ms 15736 KB Output is correct
41 Correct 48 ms 21880 KB Output is correct
42 Correct 27 ms 15992 KB Output is correct
43 Correct 455 ms 137912 KB Output is correct
44 Correct 189 ms 126072 KB Output is correct
45 Correct 214 ms 118520 KB Output is correct
46 Correct 442 ms 130040 KB Output is correct
47 Correct 432 ms 125432 KB Output is correct
48 Correct 436 ms 122220 KB Output is correct
49 Correct 413 ms 137080 KB Output is correct
50 Correct 267 ms 127144 KB Output is correct
51 Correct 448 ms 126800 KB Output is correct
52 Correct 255 ms 125532 KB Output is correct