Submission #138932

#	Time	Username	Problem	Language	Result	Execution time	Memory
138932		TAMREF	Boxes with souvenirs (IOI15_boxes)	C++11	10 / 100	3 ms	376 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;

ll delivery(int N, int K, int L, int p[]) {
    int s = 0, e = N - 1, k = K;
    while(s <= e && p[s] == 0) ++s;
    if(s > e) return 0;
    ll t = 0;
    while(s <= e){
        int ans1 = p[min(s+k-1, e)] * 2;
        int ans2 = (L-p[max(s, e-k+1)]) * 2;
        if(ans1 < ans2){
            s = min(s+k-1, e) + 1;
            t += ans1;
        }else{
            e = max(s, e-k+1) - 1;
            t += ans2;
        }
    }
    return t;
}

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