제출 #793489

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
793489		Markynoodle	선물상자 (IOI15_boxes)	C++17	0 / 100	1 ms	212 KiB

boxes

#include <bits/stdc++.h>
using namespace std;


#define ll long long


ll delivery(int n, int k, int l, int posin[]){
    vector<int> pos(n);
    for(int i =0; i<n ;i++){
        pos[i] = posin[i];
    }
    ll sol = 1e16;
    sort(pos.begin(), pos.end());
    for(int i = 0; i<=n; i++){

        ll tempsol = 0;
        int cnt = i-1;
        //int cycle = 1;
        while(cnt >= 0){
            tempsol += pos[cnt];
            tempsol += min(pos[cnt], l - pos[cnt]);
            cnt -= k;

/*
            if(cnt + 1 == i){
                tempsol += pos[cnt];
                tempsol += min(pos[cnt], l - pos[cnt]);
                break;
            }
            if(cycle == k){
                tempsol += pos[cnt];
                tempsol += min(pos[cnt], l - pos[cnt]);
                cycle = 0;
            }
            cnt++;
            cycle++;
            */
        }
        //cout<<tempsol<<" ";
        cnt = i;
        //cycle = 1;
        while(cnt <= n-1){
            tempsol += pos[cnt];
            tempsol += min(pos[cnt], l - pos[cnt]);
            cnt += k;
            /*
            if(cnt == i){
                tempsol += l - pos[cnt];
                tempsol += min(pos[cnt], l - pos[cnt]);
                break;
            }
            if(cycle == k){
                tempsol += l - pos[cnt];
                tempsol += min(pos[cnt], l - pos[cnt]);
                cycle = 0;
            }
            cnt--;
            cycle++;
            */
        }
        sol = min(sol, tempsol);
        //cout<<tempsol<<"_";

    }

    return sol;
}

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