제출 #1077321

#제출 시각아이디문제언어결과실행 시간메모리
1077321Trumling선물상자 (IOI15_boxes)C++14
10 / 100
1 ms348 KiB
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define pb push_back
#define INF 99999999999999
#define all(x) x.begin(),x.end()
typedef long long ll;

long long delivery(int N, int K, int L, int p[]) {
ll n=N;
sort(p,p+N);
ll ans=min(p[0],L-p[0]);
    for(int i=1;i<n;i++)
        ans+=min(abs(p[i]-p[i-1]), min(p[i-1],L-p[i-1]) + min(p[i],L-p[i]));

    ans+=min(p[n-1] , L - p[n-1]);

    return ans;
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:12:31: warning: unused parameter 'K' [-Wunused-parameter]
   12 | long long delivery(int N, int K, int L, int p[]) {
      |                           ~~~~^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...