Submission #1310373

#TimeUsernameProblemLanguageResultExecution timeMemory
1310373kawhietBoxes with souvenirs (IOI15_boxes)C++20
0 / 100
1 ms576 KiB
#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;

long long delivery(int n, int k, int l, int _p[]) {
    vector<int> pos(n);
    for (int i = 0; i < n; i++) {
        pos[i] = _p[i];
    }
    // vector<int> d(n);
    // for (int i = 0; i < n; i++) {
    //     d[i] = min(pos[i], l - pos[i]);
    // }
    // long long ans = 0;
    // for (int i = 0; i < n; i++) {
    //     ans += 2 * d[i];
    // }
    long long ans = l;
    ans = min(ans, 1LL * (l - pos[0]) * 2);
    ans = min(ans, 1LL * pos[n - 1] * 2);
    return ans;
}
#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...