Submission #993037

#TimeUsernameProblemLanguageResultExecution timeMemory
993037Mr_HusanboyBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms444 KiB
#include "boxes.h"

#include<bits/stdc++.h>

using namespace std;
#define ll long long

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