oj.uz

Submission #362925

# Submission time Handle Problem Language Result Execution time Memory
362925 2021-02-04T18:05:23 Z David_M Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 1 ms 512 KB 
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
long long delivery(int n, int k, int L, int p[]) {
	int Ans=1e9, l[n], r[n];
	memset (l, 0, sizeof(l));
	memset (r, 0, sizeof(r));
	for (int i=1; i<=n; i++)r[i]=r[max(i-k,0)]+p[i-1]*2,l[i]=l[max(i-k,0)]+(L-p[n-i])*2;
	for (int i=0; i<=n; i++)Ans=min(Ans, min(l[i]+r[n-i], l[i]+r[max(n-i-k, 0)]+L));
	return Ans;
}

Subtask #1
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 #2
0 / 10.0

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

Subtask #4
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 #5
0 / 20.0

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