Submission #102203

#TimeUsernameProblemLanguageResultExecution timeMemory
102203Leonardo_PaesBoxes with souvenirs (IOI15_boxes)C++11
0 / 100
3 ms640 KiB
#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)

boxes.cpp: In function 'int delivery(int, int, int, int*)':
boxes.cpp:15:13: warning: unused variable 'i' [-Wunused-variable]
     for(int i=x; x>1; x-=2){
             ^
#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...