| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 578726 | Sam_a17 | 선물상자 (IOI15_boxes) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#pragma GCC optimize("Ofast")
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T> void print(set <T> v);
template <class T> void print(vector <T> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T, class V> void print(pair <T, V> p);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(unordered_map<T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
// #include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
long long dx[8] = {-1,0,1,0,1,-1,1,-1};
long long dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "" && str != "input") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
if(str == "input") {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
}
}
// Random
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// Indexed Set
// template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// const int N = 2e5 + 10;
// long long n, k, l, p[N];
// void solve_() {
// cin >> n >> k >> l;
// for(int i = 0; i < n; i++) {
// cin >> p[i];
// }
// for(int i = 1; i <= n; i++) {
// answ = min(answ, pref[i] + suf[i + 1] - (l - p[i - 1]));
// }
// printf("%lld\n", answ);
// }
// int main() {
// setIO();
// auto solve = [&](int test_case)-> void {
// while(test_case--) {
// solve_();
// }
// };
// int test_cases = 1;
// solve(test_cases);
// return 0;
// }
#include "boxes.h"
/*
1 2 5
p[i] -> hasela i (prefix)
i <= k
p[i + k] = dp[i] + a[i + k]
s[i] -> hasela i
dp[1] = 1;
dp[2] = 2;
dp[3] = 2 + 5
*/
long long delivery(long long n, long long k, long long l, long long p[]) {
vector<long long> pref(n + 1), suf(n + 2);
for(int i = 1; i <= n; i++) {
pref[i] = pref[i - 1] + p[i - 1] * 2;
if(i >= k) {
pref[i] = min(pref[i], pref[i - k]) + 2 * p[i - 1];
}
}
for(int i = n; i >= 1; i--) {
suf[i] = suf[i + 1] + (l - p[i - 1]) * 2;
if(i <= n - k) {
suf[i] = min(suf[i], suf[i + k] + 2 * (l - p[i - 1]));
}
}
// dbg(pref)
// dbg(suf)
long long answ = pref.back();
for(int i = 1; i <= n; i++) {
// dbg(pref[i] + suf[i + 1])
answ = min(answ, pref[i] + suf[i + 1]);
}
return 0;
}