oj.uz

Submission #127952

# Submission time Handle Problem Language Result Execution time Memory
127952 2019-07-10T09:10:35 Z SOIVIEONE Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 2 ms 376 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

long long delivery(int N, int K, int L, int p[]) 
{
	long long dp[N+2], pd[N + 2];
	int n = N, k = K, l = L;
	dp[0] = 0;
	for(int i = 1; i <= n; i ++)
		dp[i] = dp[max(0, i - k)] + p[i - 1] * 2ll;
	pd[n + 1] = 0;
	for(int i = n; i >= 1; i --)
		pd[i] = pd[min(n + 1, i + k)] + (L-p[i - 1]) * 2ll;
	long long ans = 1e18;
	for(int i = 1; i <= n; i ++)
		ans = min(ans, dp[i - 1] + pd[i]);
	for(int i = 0; i < n; i ++)
	{
		if(i + k <= n)
			ans = min(ans, l + dp[i] + pd[i + k + 1]);
	}
	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 376 KB Output is correct
2 Incorrect 2 ms 376 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 -