Submission #1154396

#	Time	Username	Problem	Language	Result	Execution time	Memory
1154396		Zheing	Boxes with souvenirs (IOI15_boxes)	C++20	10 / 100	0 ms	328 KiB

boxes

#include <bits/stdc++.h>
using namespace std;

long long delivery(int N, int K, int L, int X[]) {
	vector<int> positions(N);
	for(int i = 0; i < N; ++i)positions[i] = X[i];
    long long total_time = 0;
    int i = 0;
    while (i < N) {
        int start = i;
        int end = min(i + K - 1, N - 1);
        int max_cw = positions[end];
        int first_pos = positions[start];
        int max_ccw = L - first_pos;
        
        int option1 = 2 * max_cw;
        int option2 = 2 * max_ccw;
        int option3 = L;
        
        int best = min(min(option1, option2), option3);
        total_time += best;
        
        i = end + 1;
    }
    return total_time;
}

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