Submission #429019

#TimeUsernameProblemLanguageResultExecution timeMemory
429019c4ts0upBoxes with souvenirs (IOI15_boxes)C++17
0 / 100
1 ms292 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; #define pb push_back #define ff first #define ss second ll n, k, l; vector <ll> arr; ll delivery(int N, int K, int L, int p[]) { ll cnt = 0; n = (ll)N; k = (ll)K; l = (ll)L; arr.resize(n); for (int i=0; i<n; i++) arr[i] = (ll)p[i]; for (ll x : arr) cnt += min(x, l+1-x); return cnt*2LL; }
#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...