Submission #1277293

#	Time	Username	Problem	Language	Result	Execution time	Memory
1277293		zagaro	Boxes with souvenirs (IOI15_boxes)	C++20	10 / 100	1 ms	576 KiB

boxes

#include<bits/stdc++.h>
#include "boxes.h"
#include<ext/pb_ds/assoc_container.hpp>
/**zagaro & lauren <3**/
#define mod 1000000007 //1e9 + 7
#define pi acos(-1)
#define wl while
#define str string
#define ENDL "\n"
#define sal ' '
#define tp_set ll
#define prc(n) cout.precision(n);cout<<fixed;
#define ord_set tree<tp_set, null_type, less<tp_set>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef bool bl;
typedef char car;
using namespace std;
using namespace __gnu_pbds;
ll delivery(int N, int K, int L, int p[]) {
    ll r=LONG_LONG_MAX, x, a, b;
    vector<ll> vec(N, LONG_LONG_MAX);
    vector<ll> vic(N, LONG_LONG_MAX);
    K = min(N, K);
    for(int i=0;i<K;i++){
        vec[i] = p[i]*2;
    }
    for(int i=0;i<K;i++){
        vic[N-i-1] = (L-p[N-i-1])*2;
    }
    for(int i=K;i<N;i++){
        vec[i] = vec[i-K] + 2*p[i];
    }
    for(int i=K;i<N;i++){
        vic[N-i-1] = vic[N-i+K-1] + 2*(L-p[N-i-1]);
    }
    for(int i=1;i<N;i++)r = min(r, vec[i-1]+vic[i]);
    r = min(r, min(vec[N-1], vic[0]));
    for(int i=K-1;i<N;i++){
        a=b=0;
        if(i-K >= 0)a=vec[i-K];
        if(i <= N-2)b=vec[i+1];
        r = min(r, a+L+b);
    }
    return r;
}

• Subtask 1: 0 / 10
• Subtask 2: 10 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30