# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1056874 | Faisal_Saqib | Boxes with souvenirs (IOI15_boxes) | C++17 | 376 ms | 293992 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 "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define all(x) begin(x),end(x)
#define pb push_back
long long delivery(int n, int k, int LP, int p[])
{
ll l=LP;
// if(k==1)
// {
// ll ans=0;
// for(int i=0;i<n;i++)
// ans+=(2ll*(ll)min(p[i],l-p[i]));
// return ans;
// }
// else if(k==n){
ll ans=1e18;
ll pq[n],qp[n];
pq[0]=min(l,2ll*p[0]);
for(int i=1;i<n;i++)
{
pq[i]=min(l,2ll*p[i]);
if((i-k)>=0)
pq[i]+=pq[i-k];
}
ll mx=0;
ans=min(ans,pq[n-1]);
for(int j=n-1;j>=0;j--)
{
qp[j]=min(l,2ll*(l-p[j]));
if((j+k)<n)
qp[j]+=qp[j+k];
if(j==0)
{
ans=min(ans,qp[j]);
}
else{
ans=min(ans,qp[j]+pq[j-1]);
}
}
return ans;
// }
// return 0;
}
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... |