제출 #1352740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1352740		ElayV13	선물상자 (IOI15_boxes)	C++20	15 / 100	2095 ms	408 KiB

boxes

#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;

#define ll long long
const ll INF=1e18;

ll NC;
ll LC;

ll cost(ll a,ll b){
      return min(abs(a-b),abs(max(a,b)-(min(a,b)+LC)));
}

ll delivery(int N,int K,int L,int p[])
{
      NC=N;
      LC=L;
      ll ans=INF;
      vector<int>per;
      for(int i=0;i<N;i++) per.push_back(p[i]);
      sort(per.begin(),per.end());
      do{
            ll res=0;
            for(int i=0;i<N;i+=K){
                  int l=i,r=min(N-1,i+K-1);
                  int cur=0;
                  for(int j=l;j<=r;j++){
                        res+=cost(cur,per[j]);
                        cur=per[j];
                  }
                  res+=cost(0,cur);
            }
            ans=min(ans,res);
      }while(next_permutation(per.begin(),per.end()));
      return ans;
}

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