제출 #427684

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
427684		Dan4Life	선물상자 (IOI15_boxes)	C++17	35 / 100	207 ms	300 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll delivery(int n, int k, int l, int a[])
{
    if(n<=10)
    {
        ll ans = 100000000000;
        vector<int> v; v.clear();
        for(int i = 0; i < n; i++) v.push_back(a[i]);
        do
        {
            ll sum = 0; int cur = 0;
            for(int i = 0; i < n; i++)
            {
                sum+=min(abs(cur-v[i]), l-abs(cur-v[i])), cur = v[i];
                if(i%k==k-1) sum+=min(cur, l-cur), cur = 0;
            }
            sum+=min(cur, l-cur), ans = min(ans, sum);
        }while(next_permutation(v.begin(), v.end()));
        return ans;
    }
    else if(k==1){
        ll ans = 0;
        for(int i = 0; i < n; i++) ans+=min((ll)a[i], (ll)l-a[i]);
        return ans*2;
    }
    else if(k==n){
        ll ans = min({l, a[n-1]*2, (l-a[0])*2});
        for(int i = 0; i < n-1; i++)
            ans = min(ans, (ll)(a[i]+(l-a[i+1]))*2ll),
            ans = min(ans, (ll)(a[i-1]+(l-a[i]))*2ll);
        return ans;
    }
    else if(n<=1000){
        ll ans = 0ll; int cur = 0;
        map<int,int> M; M.clear();
        for(int i = 0; i < n; i++) M[a[i]]++;
        for(int i = 0; i < n; i++)
        {
            ans+=min(abs(cur-a[i]), l-abs(cur-a[i])), cur = a[i];
            if(i%k==k-1) ans+=min(cur, l-cur), cur = 0;
        }
        return ans;
    }
}

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:47:1: warning: control reaches end of non-void function [-Wreturn-type]
   47 | }
      | ^

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