제출 #431049

#제출 시각아이디문제언어결과실행 시간메모리
431049muhammad_hokimiyon선물상자 (IOI15_boxes)C++14
10 / 100
4 ms204 KiB
#include "boxes.h" #include <bits/stdc++.h> #define fi first #define se second #define ll long long #define dl double using namespace std; ll delivery(int N, int K, int L, int P[]) { vector<ll> d(N + 1, 1e18); d[0] = 0; vector<ll> p(N + 1, 0); for(int i = 1; i <= N; i++)p[i] = P[i - 1]; sort(p.begin(), p.end()); auto go = [&](int i, int j) -> ll{ ll res = 1e18; res = min(res, abs(p[i] - p[j])); res = min(res, L - p[i] + p[j]); res = min(res, L - p[j] + p[i]); return res; }; for(int i = 1; i <= N; i++){ for(int j = i; j >= 1; j--){ if(i - j + 1 > K)break; d[i] = min(d[i], d[j - 1] + go(0, i) + go(i, j) + go(j, 0)); } } return d[N]; }
#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...