Submission #1265697

#TimeUsernameProblemLanguageResultExecution timeMemory
1265697scalifrastico_098선물상자 (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int n, int k, int l, int p[]) { long long m=0; int y=l, u=INT_MAX; vector<int> a(n); for(int i=0;i<n; i++)a[i]=p[i]; sort(a.begin(), a.end()); for(int i=0; i<n; i++) { y=min(min(l-(a[i]-a[i+1]), y), 2*(a[i]+(l-a[i]))); } for(long long i=0; i<n; i++) { m+=2*(min(p[i], l-p[i])); } if(k==1) return m; return y; }
#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...