# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102210 | 2019-03-23T15:32:08 Z | Leonardo_Paes | Boxes with souvenirs (IOI15_boxes) | C++11 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; const int MAXN = 2e7 + 10; //int n, k, l, vet[MAXN]; long long delivery(long long N, long long K, long long L, long long positions[MAXN]){ long long x = N, sum=0; long long ini=0, fim=N-1; for(int i=x; i>1; i-=2){ if(ini+(K-1)<=N-1 and fim-(K-1)>=0 and (2*(positions[ini+(K-1)]))<(2*(L-positions[fim-(K-1)]))){ sum+=(long long)2*(long long)(positions[ini+(K-1)]); ini+=K; } else if (2*(L-positions[fim-(K-1)]) < L){ sum+=2*(L-positions[fim-(K-1)]); fim-=K; } else{ sum+=L; ini+=K; } } sum+=(long long)min(2*positions[ini], 2*(L-positions[fim])); return sum; } /* int main(){ cin >> n >> k >> l; for(int i=0; i<n; i++){ cin >> vet[i]; } cout << delivery(n, k, l, vet) << endl; } */