제출 #1091542

#제출 시각아이디문제언어결과실행 시간메모리
1091542triplem5ds선물상자 (IOI15_boxes)C++14
0 / 100
1 ms348 KiB
#include "boxes.h" #include <bits/stdc++.h> long long cost[10000007]; using namespace std; long long delivery(int N, int K, int L, int p[]) { if(N == 1) return min(p[0], L - p[0]); long long cur = 0; for(int i = 0, j = 0; i < N; i++) { if((j+=1) == K) j = 0; cost[i] = cur + p[i]; if(j == 0) cur += p[i]; } long long ans = cost[N - 1]; for(int i = N - 1, j = 0; i >= 0; i--) { if((j+=1) == K) j = 0; cost[i] = cur + L - p[i]; if(j == 0) cur += L - p[i]; if(i!=0) ans = min(ans, cost[i] + cost[i - 1]); } ans = min(ans, cost[0]); 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...