oj.uz

Submission #963663

# Submission time Handle Problem Language Result Execution time Memory
963663 2024-04-15T12:37:36 Z hirayuu_oj Boxes with souvenirs (IOI15_boxes) C++17
0 / 100
 0 ms 348 KB 
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define all(x) x.begin(),x.end()
using ll=long long;
const ll INF=1LL<<60;

long long delivery(int N, int K, int L, int p[]) {
    vector<ll> dp(N+1,0);
    rep(i,N){
        dp[i+1]=p[i]+dp[max(0,i+1-K)]+min(p[i],L-p[i]);
    }
    vector<ll> dp2(N+1,0);
    rep(i,N){
        p[i]=(L-p[i])%L;
    }
    vector<int> ps(N);
    rep(i,N){
        ps[i]=p[i];
    }
    rep(i,N){
        dp2[i+1]=ps[i]+dp2[max(0,i+1-K)]+min(ps[i],L-ps[i]);
    }
    ll ans=INF;
    rep(i,N+1){
        ans=min(ans,dp[i]+dp2[N-i]);
    }
    return ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
0 / 10.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 20.0

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

Subtask #6
0 / 30.0

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