oj.uz

Submission #122446

# Submission time Handle Problem Language Result Execution time Memory
122446 2019-06-28T09:50:09 Z eohomegrownapps Boxes with souvenirs (IOI15_boxes) C++14
0 / 100
 3 ms 384 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

ll delivery(int n, int k, int l, int p[]) {
    vector<ll> dp(n,0);
    for (ll i = 0; i<n; i++){
        ll minval = -1;
        for (ll j = max((i-k+1),0LL); j<=i; j++){
            //from j to i inclusive.
            ll val = min(min((l-p[j])*2,(p[j]+l-p[i])*2),min(l,p[i]*2));
            if (j>=0){
                val+=dp[j-1];
            }
            if (minval==-1||minval>val){
                minval=val;
            }
        }
        dp[i]=minval;
        //cout<<dp[i]<<endl;
    }
    return dp[n-1];
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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