제출 #528919

#제출 시각아이디문제언어결과실행 시간메모리
528919Alex_tz307선물상자 (IOI15_boxes)C++17
0 / 100
1 ms296 KiB
#include <bits/stdc++.h>

using namespace std;

int64_t delivery(int n, int k, int l, int a[]) {
  int full = n / k, rem = n % k;
  int64_t ans = (int64_t)full * l;
  if (rem) {
    ans += min(a[rem - 1] * 2, (l - a[n - rem]) * 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...