Submission #314213

#	Time	Username	Problem	Language	Result	Execution time	Memory
314213		Karliver	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	1 ms	384 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"

using namespace std;

long long delivery(int N, int K, int L, int p[]) {
    long long ans = 0;
    int cur_pos = 0;
    
    int q = K;
    for(int i = 0;i < N;++i) {
        if(K == 0) {
            K = q;
            ans += min(cur_pos, L - cur_pos);
            cur_pos = 0;
        }
        ans += min(abs(p[i] - cur_pos), L - abs(p[i] - cur_pos));

        cur_pos = p[i];
        --K;
    }
    ans += min(cur_pos, L - cur_pos);
    return ans;
}

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