oj.uz

Submission #218471

# Submission time Handle Problem Language Result Execution time Memory
218471 2020-04-02T07:56:29 Z socho Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 5 ms 512 KB 
#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;

const long long MXN = 10005;
long long n, k, l, h, pos[MXN], rpos[MXN];
long long dpleft[MXN];
long long dpright[MXN];

long long delivery(int N, int K, int L, int p[]) {
    #define int long long
	for (int i=0; i<MXN; i++) {
		dpleft[i] = -1;
		dpright[i] = -1;
	}
	n = N;
	k = K;
	l = L;
	h = l/2;
	for (int i=0; i<n; i++) {
		pos[i] = p[i];
		rpos[i] = L - p[i];
	}
	int best = LLONG_MAX;
	for (int i=0; i<n; i++) {
		dpleft[i] = pos[i] * 2;
		if (i - k >= 0) dpleft[i] += dpleft[i-k];
	}
	for (int i=n-1; i>=0; i--) {
		dpright[i] = rpos[i] * 2;
		if (i + k < n) dpright[i] += dpright[i+k];
	}
	// for (int i=0; i<n; i++) cout << dpleft[i] << ' '; cout << endl;
	// for (int i=0; i<n; i++) cout << dpright[i] << ' '; cout << endl;
	
	for (int i=0; i<n-1; i++) {
		best = min(best, dpleft[i] + dpright[i+1]);
	}
	for (int i=0; i<n-1; i++) {
		int unt = l;
		if (i >= 1) unt += dpleft[i-1];
		if (i + k < n) unt += dpright[i+k];
	}
	
	return best;
	
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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