제출 #410033

#제출 시각아이디문제언어결과실행 시간메모리
410033robs선물상자 (IOI15_boxes)C++17
0 / 100
1 ms204 KiB
#include "boxes.h" #include <bits/stdc++.h> #define debug(args...) fprintf(stderr, args) using namespace std; const int maxn = 2e7, INF = 1e9; int n, k, m, dp1[maxn], dp2[maxn], ini[maxn], fim[maxn], resp; long long delivery(int N, int K, int L, int p[]) { n = N; m = L; k = K; resp = INF; for(int x = 0; x < n; x++) ini[x] = 2*p[x] + ((x >= k)?ini[x-k]:0); for(int x = n-1; x >= 0; x--) fim[x] = 2*(m-p[x]) + ((x+k < n)?ini[x+k]:0); for(int x = 0; x < n-1; x++) resp = min(resp, ini[x]+fim[x+1]); for(int x = 1; x+k < n; x++) resp = min(resp, ini[x-1]+m+fim[x+k]); // debug("%d\n",resp); // for(int x = 0; x < n; x++) // debug("ini[%d] = %d, fim[%d] = %d// %d // %d\n",x,ini[x],x,fim[x],ini[x]+fim[x+1],ini[x-1]+m+fim[x+k]); return resp; }
#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...