| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1052490 | modwwe | 선물상자 (IOI15_boxes) | C++17 | 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.
//https://www.instagram.com/_modwwe/
//#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
void phongbeo();
const ll inf=1e18;
const int mod2=1e9+7;
const int mod1=998244353;
struct icd
{
long double a;
int b;
};
struct ib
{
ll a;
ll b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c,d,e;
};
ll n,m,s1,s2,s4,s3,sf,k,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,l,r,mid;
int i,s10,s12;
int kk;
int el=29;
int a[10000002];
int dp[10000002];
int dp2[10000002];
long long delivery(int N, int K, int L, int p[])
{
n=N;
k=K;
m=L;
for(int i=1; i<=N; i++)
{
a[++dem]=p[i];
if(a[dem]==0) dem--,n--;
}
for(int i=1;i<=n;i++)
{
dp[i]=dp[max(i-k,0ll)]+min(m,a[i]*2);
}
s2=0;
for(int i=n;i>=1;--i)
dp2[i]=dp2[min(i+k,n+1)]+min((m-a[i])*2,m);
s4=inf;
for(int i=0;i<=n;i++)
s4=min(s4,dp[i]+dp2[i+1]);
cout<<s4;
}