oj.uz

Submission #54608

# Submission time Handle Problem Language Result Execution time Memory
54608 2018-07-04T07:57:41 Z aome Boxes with souvenirs (IOI15_boxes) C++17
10 / 100
 2 ms 380 KB 
#include "boxes.h"

#include <bits/stdc++.h>

using namespace std;

const int M = 10000005;
const long long INF = 1e18;

long long f[2][M], g[M];

long long delivery(int N, int K, int L, int p[]) {
	int pos = -1;
	for (int i = 0; i < N; ++i) if (p[i] * 2 <= L) pos = i;
	for (int i = 0; i <= pos; ++i) {
		if (i + 1 <= K) f[0][i] = p[i] * 2;
		else f[0][i] = f[0][i - K] + p[i] * 2;
	}
	for (int i = N - 1; i > pos; --i) {
		if (N - pos <= K) f[1][i] = (L - p[i]) * 2;
		else f[1][i] = f[1][i + K] + (L - p[i]) * 2;
	}
	for (int i = 0; i <= K; ++i) g[i] = INF;
	for (int i = pos; i >= 0; --i) {
		if (pos - i > K) break;
		g[pos - i] = f[0][i];
	}
	for (int i = 1; i <= K; ++i) g[i] = min(g[i], g[i - 1]);
	long long res = INF;
	res = min(res, g[0] + f[1][pos + 1]);
	for (int i = pos + 1; i < N; ++i) {
		if (i - pos - 1 > K) break;
		res = min(res, f[1][i] + g[K - (i - pos - 1)] + L);
	}
	return res;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 376 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct

Subtask #2
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 #3
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 #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 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 376 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 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 380 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 376 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 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 380 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 376 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Incorrect 2 ms 376 KB Output isn't correct
9 Halted 0 ms 0 KB -