oj.uz

Submission #699128

# Submission time Handle Problem Language Result Execution time Memory
699128 2023-02-15T17:19:40 Z epicci23 Boxes with souvenirs (IOI15_boxes) C++17
0 / 100
 1 ms 212 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+1];

 for(int i=1;i<=K;i++) dp[i]=2*min(L-p[i],p[i]);
 for(int i=K+1;i<=N;i++) dp[i]=dp[i-K] + min(p[i]+min(p[i],L-p[i]),L-p[i-K+1]+min(L-p[i-K+1],p[i-K+1]));

 return dp[N];
}

Subtask #1
0 / 10.0

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

Subtask #3
0 / 15.0

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