제출 #386637

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
386637		mehrdad_sohrabi	선물상자 (IOI15_boxes)	C++14	10 / 100	2 ms	384 KiB

boxes

/// Black lives matter
#include <bits/stdc++.h>
#include "boxes.h"
/// 500 485 462 A4
using namespace std;
typedef long long int ll;
typedef complex<double> point;
typedef long double ld;
#define pb push_back
#define pii pair < ll , ll >
#define F first
#define S second
//#define endl '\n'
#define int long long
#define sync ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#define kill(x) return cout<<x<<'\n', 0;
const int MAXN=1e5+10;
ll dp[MAXN],pd[MAXN];
ll t[MAXN];
long long delivery(int32_t n, int32_t k, int32_t l, int32_t p[]) {
    for (int i=0;i<=n;i++) dp[i]=(ll)1e15,pd[i]=(ll)1e15;
    sort(p,p+n);
    ll cnt=0;
    dp[0]=0,pd[0]=0;
    for (int i=0;i<n;i++){
        cnt++;
        dp[cnt]=(ll)min(l,2*p[i])+dp[max((ll)0,cnt-k)];
    }
    cnt=0;
    for (int i=n-1;i>-1;i--){
        cnt++;
        pd[cnt]=(ll)min(l,2*((l-p[i])%l))+pd[max((ll)0,cnt-k)];
    }
    ll ans=(ll)1e15;
    if (k==n) ans=min(ans,(ll)l);
    for (int i=0;i<=n;i++){
        ans=min(ans,dp[i]+pd[n-i]);
    }
    return ans;
}
/*
int32_t p[MAXN];
int32_t main(){
    sync;
    ll n,k,l;
    cin >> n >> k >> l;
    for (int i=0;i<n;i++){
        cin >> p[i];
    }
    cout << delivery(n,k,l,p);
}
*/
/*
3 2 8
1 2 5
*/

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30