Submission #441121

#TimeUsernameProblemLanguageResultExecution timeMemory
441121NintsiChkhaidzeBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms296 KiB
#include "boxes.h"
#include <iostream>
#define ll long long
using namespace std;

long long delivery(int n, int k, int L, int p[]) {
    int darch = n;
    ll ans = 0;
    for (int i = 0; i < n; i++){
        int m = min(darch,k);
        int l = p[i],r = p[i + m - 1];
        ans += min(L - l,r)*2;
        darch -= m;
        i = i + m - 1;
    }
    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...