제출 #1015310

#제출 시각아이디문제언어결과실행 시간메모리
1015310Muhammet선물상자 (IOI15_boxes)C++17
0 / 100
2 ms348 KiB
#include <bits/stdc++.h> #include "boxes.h" #define N 10005 #define ll long long using namespace std; ll p[N], s[N]; ll delivery(int n, int k, int l, int a[]) { for(int i = 0; i < n; i++){ int ind = i; while(ind >= 0){ p[i+1] += (2*a[ind]); ind -= k; } } for(int i = n-1; i >= 0; i--){ int ind = i; while(ind < n){ s[i+1] += (2*(l-a[ind]+1)); ind += k; } } ll ans = LLONG_MAX; for(int i = 0; i <= n; i++){ for(int j = i + 1; j <= n+1; j++){ ans = min(ans,p[i] + s[j] + ((j-i-1+k-1)/k)*(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...