oj.uz

Submission #119720

# Submission time Handle Problem Language Result Execution time Memory
119720 2019-06-22T01:47:50 Z nxteru Boxes with souvenirs (IOI15_boxes) C++14
10 / 100
 2 ms 384 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=0;i<n;i++){
		q[i]=p[i];
		if(m==-1&&p[i]>l/2)m=i;
	}
	if(m==-1)m=n;
    for(int i=m-1;i>=0;i-=k){
		x[0]+=q[i]*2;
	}
	int r=0;
	for(int i=m-2;i>=0;i--){
		x[r%k+1]-=(q[i+1]-q[i])*2;
		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])*2;
	}
	r=0;
	for(int i=m+1;i<n;i++){
		y[r%k+1]-=(q[i]-q[i-1])*2;
		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
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
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 Incorrect 2 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
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 Incorrect 2 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #6
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 Incorrect 2 ms 384 KB Output isn't correct
9 Halted 0 ms 0 KB -