제출 #165336

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
165336		losmi247	Boxes with souvenirs (IOI15_boxes)	C++14	20 / 100	3 ms	376 KiB

boxes

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e7+67;

ll n,k,l,a[N];

ll delivery(int d,int K,int L,int positions[]){
    n = d,k = K,l = L;
    for(int i = 1; i <= n; i++){
        a[i] = positions[i-1];
    }
    if(k == 1){
        ll sol = 0;
        for(int i = 1; i <= n; i++){
            sol += min({2*a[i],2*(l-a[i]),l});
        }
        return sol;
    }
    if(k == n){
        ll mini = 10000000000,maxi = -1;
        ll maxil = -1,minid = 10000000000;
        for(int i = 1; i <= n; i++){
            maxi = max(maxi,a[i]);
            mini = min(mini,a[i]);
            if(a[i] <= l/2){
                maxil = max(maxil,a[i]);
            }
            else{
                minid = min(minid,a[i]);
            }
        }
        ll sol = min({2*maxi,2*(l-mini),l});
        if(maxil != -1 && minid != 10000000000){
            sol = min(sol,2*maxil+2*(l-minid));
        }
        return sol;
    }
}

/*int main(){

}*/

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

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

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