제출 #642059

#제출 시각아이디문제언어결과실행 시간메모리
642059QwertyPi선물상자 (IOI15_boxes)C++14
100 / 100
526 ms221256 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long dp_l[10000001]; long long dp_r[10000001]; long long delivery(int N, int K, int L, int p[]) { for(int i = 0; i < N; i++){ dp_l[i + 1] = dp_l[max(0, i + 1 - K)] + min(L, p[i] * 2); } for(int i = N; i >= 1; i--){ dp_r[i] = dp_r[min(N + 1, i + K)] + min(L, (L - p[i - 1]) * 2); } long long ans = 1LL << 60; for(int l = 0; l <= N; l++){ ans = min(ans, dp_l[l] + dp_r[l + 1]); } 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...