# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444906 | Khizri | 선물상자 (IOI15_boxes) | C++17 | 805 ms | 197008 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 pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
const int mxn=1e7+5;
ll l[mxn],r[mxn];
long long delivery(int n, int k, int dis, int arr[]) {
ll ans=INF;
sort(arr,arr+n);
for(int i=0;i<n;i++){
if(i<k){
l[i]=min(1ll*dis,arr[i]*2ll);
}
else{
l[i]=l[i-k]+min(1ll*dis,arr[i]*2ll);
}
}
ll say=0,ind=0;
for(int i=n-1;i>=0;i--){
if(say<k){
r[i]=min(1ll*dis,(dis-arr[i])*2ll);
}
else{
r[i]=r[i+k]+min(1ll*dis,(dis-arr[i])*2ll);
}
say++;
}
ans=min(r[0],l[n-1]);
r[n]=0;
for(int i=0;i<n-1;i++){
ans=min(l[i]+r[i+1],ans);
}
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... |