Submission #444468

#TimeUsernameProblemLanguageResultExecution timeMemory
444468osmanallazovBoxes with souvenirs (IOI15_boxes)C++14
0 / 100
1 ms204 KiB
#include "boxes.h" #include<bits/stdc++.h> #define ll long long long long delivery(int N, int K, int L, int p[]) { ll res=0; if(K==1){ for(int i=0;i<N;i++){ if(p[i]==0){ res+=0; } else if(p[i]<=L/2){ res+=(p[i]*2); } else{ res+=((N-p[i])*2); } } } return res; }
#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...