Submission #1216712

#TimeUsernameProblemLanguageResultExecution timeMemory
1216712lizi14Boxes with souvenirs (IOI15_boxes)C++20
0 / 100
264 ms589824 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int N, int K, int L, int p[]) { int x[L]; fill(x,x+L,0); for(int i=0; i<N; i++){ cin>>p[i]; x[p[i]]=1; } int ans=0; for(int i=1; i<L; i++){ if(x[i]==1){ ans+=min(i,L-i); } } return (ans*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...