제출 #993041

#제출 시각아이디문제언어결과실행 시간메모리
993041Mr_Husanboy선물상자 (IOI15_boxes)C++17
0 / 100
1 ms348 KiB
#include "boxes.h" #include<bits/stdc++.h> using namespace std; #define ll long long long long delivery(int n, int k, int l, int p[]) { ll ans = 0; if(k == n){ int mx = *max_element(p, p + n), mn = *min_element(p, p + n); return min({l, 2 * mn, 2 * (l - mx), 2 * (mx - mn)}); } assert(k == 1); for(int i = 0; i < n; i ++){ ans += min(p[i], l - p[i]) * 2; } return ans; }
#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...