oj.uz

Submission #120337

# Submission time Handle Problem Language Result Execution time Memory
120337 2019-06-24T08:24:00 Z turbat Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 2 ms 384 KB 
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;

long long a[10000005], dp[10000005], dp1[10000005], ans = 1e18;
long long delivery(int N, int K, int L, int p[]) {
	for (int i = 0;i < N;i++){
		a[i] = L - p[N - 1 - i];
		if (i < K) {
			dp[i + 1] = p[i] * 2;
			dp1[i + 1] = a[i] * 2;
		}
		else {
			dp[i + 1] = dp[i - K + 1] + p[i] * 2;
			dp1[i + 1] = dp1[i - K + 1] + a[i] * 2;
		}
	}
	for (int i = 0;i <= N;i++){
		ans = min(ans,  dp[i] + dp[N - i]);
		if (i + K <= N) ans = min(ans, dp[i] + L + dp1[N - i - K]);
	}
    return ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 384 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 384 KB Output is correct
2 Incorrect 2 ms 384 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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