oj.uz

Submission #949077

# Submission time Handle Problem Language Result Execution time Memory
949077 2024-03-19T00:17:57 Z irmuun Boxes with souvenirs (IOI15_boxes) C++17
0 / 100
 1 ms 348 KB 
#include<bits/stdc++.h>

using namespace std;

#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

ll delivery(int N,int K,int L,int pos[]){
    ll pre[N+5],suf[N+5],ans=1e18;
    suf[N]=0;
    for(int i=0;i<K;i++){
        pre[i]=pos[i];
    }
    for(int i=K;i<N;i++){
        pre[i]=pre[i-K]+pos[i];
    }
    for(int i=N-1;i>=N-K;i--){
        suf[i]=pos[i];
    }
    for(int i=N-K-1;i>=0;i--){
        suf[i]=suf[i+K]+(L-pos[i]);
    }
    ans=min(ans,suf[0]*2);
    for(int i=0;i<N-1;i++){
        ans=min(ans,pre[i]*2+suf[i+1]*2);
    }
    ans=min(ans,suf[K]*2+L);
    for(int i=K;i<=N;i++){
        ans=min(ans,pre[i-K]*2+suf[i]*2+L);
    }
    return ans;
}

Subtask #1
0 / 10.0

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

Subtask #4
0 / 15.0

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