Submission #1278988

#TimeUsernameProblemLanguageResultExecution timeMemory
1278988coderg300711Boxes with souvenirs (IOI15_boxes)C++20
100 / 100
344 ms213716 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int maxn=2e7; ll l[maxn],r[maxn]; long long delivery(int n,int k,int m,int p[]){ for(int i=1;i<=n;i++)l[i]=l[max(0,i-k)]+min(p[i-1]*2,m); reverse(p,p+n); for(int i=1;i<=n;i++)r[i]=r[max(0,i-k)]+min((m-p[i-1])*2,m); ll rs=1e18; for(int i=0;i<=n;i++)rs=min(rs,l[i]+r[n-i]); return rs; }
#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...