Submission #1155191

#TimeUsernameProblemLanguageResultExecution timeMemory
1155191aarb_.tomatexdBoxes with souvenirs (IOI15_boxes)C++20
10 / 100
0 ms400 KiB
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll delivery(int N, int K, int L, int positions[]) {
    ll time = 0;
    vector<int> right, left;
    for (int i = 0; i < N; i++) {
        int pos = positions[i];
        if (pos == 0) continue;
        if (pos <= L - pos)
            right.push_back(pos);
        else
            left.push_back(L - pos);
    }
    sort(right.begin(), right.end(), greater<int>());
    sort(left.begin(), left.end(), greater<int>());
    auto computeTrips = [&](const vector<int>& vec) -> ll {
        ll cost = 0;
        for (int i = 0; i < (int)vec.size(); i += K) {
            cost += 2LL * vec[i];
        }
        return cost;
    };
    time = computeTrips(right) + computeTrips(left);
    return time;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...