제출 #699128

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