oj.uz

Submission #67835

# Submission time Handle Problem Language Result Execution time Memory
67835 2018-08-15T10:49:52 Z gnoor Boxes with souvenirs (IOI15_boxes) C++17
0 / 100
 2 ms 376 KB 
#include "boxes.h"

#include <algorithm>

using namespace std;

int posl[10000100];
int posr[10000100];
int cntl;
int cntr;

long long dpl[10000100];
long long dpr[10000100];

long long delivery(int N, int K, int L, int p[]) {
	int m=L/2;
	for (int i=0;i<N;i++) {
		if (p[i]<=m) {
			posl[cntl++]=p[i];
		} else {
			posr[cntr++]=L-p[i];
		}
	}
	reverse(posr,posr+cntr);
	for (int i=0;i<min(cntl,K);i++) {
		dpl[i]=posl[i]*2;
	}
	for (int i=K;i<cntl;i++) {
		dpl[i]=dpl[i-K]+posl[i]*2;
	}
	for (int i=0;i<min(cntr,K);i++) {
		dpr[i]=posr[i]*2;
	}
	for (int i=K;i<cntr;i++) {
		dpr[i]=dpr[i-K]+posr[i]*2;
	}
	long long ans=1e16;
	for (int i=0;i<=min(cntl,K);i++) {
		ans=min(ans,dpl[cntl-i-1]+((cntr-(K-i)-1<0)?0:dpr[cntr-(K-i)-1])+L);	
	}
	return ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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