Submission #115502

#TimeUsernameProblemLanguageResultExecution timeMemory
115502E869120선물상자 (IOI15_boxes)C++14
0 / 100
3 ms512 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int N, int K, int L, int p[]) { assert(N == K); long long minx = (1LL << 60); for (int i = -1; i < N; i++) { long long sum = 0; for (int j = i; j >= 0; j -= K) sum += 1LL * p[j]; for (int j = i + 1; j < N; j += K) sum += 1LL * (L - p[j]); minx = min(minx, 2LL * sum); } return minx; }
#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...