제출 #1198696

#제출 시각아이디문제언어결과실행 시간메모리
1198696Zicrus선물상자 (IOI15_boxes)C++17
0 / 100
0 ms324 KiB
#include <bits/stdc++.h> #include "boxes.h" using namespace std; typedef long long ll; ll delivery(int n, int k, int l, int p[]) { vector<ll> a(n+1), b(n+1); for (int i = 0; i < n; i++) a[i+1] = b[i+1] = p[i]; for (int i = k+1; i <= n; i++) a[i] += a[i-k]; for (int i = n-k; i > 0; i--) b[i] += b[i+k]; ll res = 1ll << 62ll; for (int i = 1; i <= n; i++) res = min(res, a[i-1] + b[i]); for (int i = 1; i + k <= n; i++) res = min(res, l + a[i-1] + b[i + k]); return res; }
#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...