oj.uz

Submission #963550

# Submission time Handle Problem Language Result Execution time Memory
963550 2024-04-15T09:51:59 Z Hugo1729 Boxes with souvenirs (IOI15_boxes) C++11
10 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
typedef long long ll;

ll delivery(int N, int K, int L, int p[]){

    vector<ll> left(N+1,0),right(N+1,0);

    for(int i=0;i<N;i++){
        if(i<K){
            left[i+1]=min(p[i]*2,L);
            right[i+1]=min((L-p[N-1-i])*2,L);
        }else{
            left[i+1]=min(p[i]*2,L)+left[i+1-K];
            right[i+1]=min(L-p[N-1-i]*2,L)+right[i+1-K];
        }
    }

    // for(int i=0;i<N;i++)p[i]=L-p[i];
    

    // for(int i=0;i<N;i++){
    //     if(i<K){
    //         right[i+1]=min(p[i]*2,L);
    //     }else{
    //         right[i+1]=min(p[i]*2,L)+right[i+1-K];
    //     }
    // }

    ll ans=LLONG_MAX;

    for(int i=0;i<N+1;i++)ans=min(ans,left[i]+right[N-i]);

    // for(int i=0;i<N+1;i++)cout << left[i] << ' ';
    // cout << '\n';
    // for(int i=0;i<N+1;i++)cout << right[i] << ' ';
    // cout << '\n';


    return ans;
}

Subtask #1
0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 15.0

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