제출 #425499

#제출 시각아이디문제언어결과실행 시간메모리
425499haxorman선물상자 (IOI15_boxes)C++14
10 / 100
1 ms304 KiB
#include "boxes.h" #include "bits/stdc++.h" using namespace std; int n, k, l; long long delivery(int N, int K, int L, int p[]) { n = N, k = K, l = L; long long ans = 0; for (int i = 0; i < n; ++i) { ans += min(p[i], (l - 1) - p[i] + 1) * 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...