oj.uz

Submission #346831

# Submission time Handle Problem Language Result Execution time Memory
346831 2021-01-11T07:21:47 Z 1bin Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 1 ms 364 KB 
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;
ll x, ans;
vector<ll> arr, A, B;

ll delivery(int N, int K, int L, int positions[]) {
	arr.resize(N + 2);
	for (int i = 1; i <= N; i++) arr[i] = positions[i - 1];
	A.resize(N + 2); B.resize(N + 2);
	for (int i = 0; i <= N; i++) {
		if (i <= K) A[i] = arr[i] * 2;
		else A[i] = arr[i] * 2 + A[i - K];
	}
	for (int i = N + 1; i; i--) {
		if (i >= N + 1 - K) B[i] = (L - arr[i]) * 2;
		else B[i] = (L - arr[i]) * 2 + B[i + K];
	}
	ans = 198765432198765432;
	for (int i = 0; i <= N; i++)
		ans = min(ans, A[i] + B[i + 1]);
	for (int i = 0; i <= N; i++) {
		if(i + 1 + K <= N + 1)
			ans = min(ans, A[i] + L + B[i + 1 + K]);
	}
	return ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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