# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
363602 | Sparky_09 | Boxes with souvenirs (IOI15_boxes) | C++17 | 153 ms | 235244 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.
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
void usaco(string s){
freopen((s+".in").c_str(), "r", stdin);
freopen((s+".out").c_str(), "w", stdout);
}
ll maxn = 1e7+1000, n1, k1, l1;
vector<ll> pre(maxn+2, 0), suf(maxn+2, 0), pos1(maxn+2);
int delivery(int n, int k, int l, int pos[]){
n1=n;k1=k;l1=l;
for(int i = 0; i < n; i++) pos1[i] = pos[i];
for(int i = 0; i < n; i++){
pre[i] = (i>=k?pre[i-k]+min(l1,2*pos1[i]):min(l1,2*pos1[i]));
}
for(int i = n-1; i >= 0; i--){
suf[i] = (i<=n-1-k?suf[i+k]+min(l1,2*(l1-pos1[i])):min(l1,2*(l1-pos1[i])));
}
ll ans = min(pre[0],suf[0]);
for(int i = 0; i < n; i++){
ans = min(ans, pre[i] + suf[i+1]);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |