Submission #356468

#TimeUsernameProblemLanguageResultExecution timeMemory
356468leinad2Boxes with souvenirs (IOI15_boxes)C++17
0 / 100
1 ms372 KiB
#include "boxes.h" #include<bits/stdc++.h> using namespace std; int i; long long delivery(int n, int k, int l, int p[]) { if(k==1) { int ans=0; for(i=0;i<n;i++) { ans+=(min(p[i], l-p[i])*2); } return ans; } return 0; }
#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...