# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
102203 | Leonardo_Paes | Boxes with souvenirs (IOI15_boxes) | C++11 | 3 ms | 640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e7 + 10;
//int n, k, l, vet[MAXN];
int delivery(int N, int K, int L, int positions[MAXN]){
int x = N, sum=0;
int ini=0, fim=N-1;
for(int i=x; x>1; x-=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+=2*(positions[ini+(K-1)]);
ini+=K;
}
else{
sum+=2*(L-positions[fim-(K-1)]);
fim-=K;
}
}
sum+=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;
}
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |