제출 #102216

#제출 시각아이디문제언어결과실행 시간메모리
102216Leonardo_Paes선물상자 (IOI15_boxes)C++11
컴파일 에러
0 ms0 KiB
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e7 + 10;

//int n, k, l, vet[MAXN];

typedef long long ll;

long long delivery(long long N, long long K, long long L, int positions[MAXN]){

    long long x = N, sum=0;

    long long ini=0, fim=N-1;

    for(long long i=x; i>1; i-=2){
        if(ini+(K-1)<=N-1 and fim-(K-1)>=0 and (2ll*(positions[ini+(K-1)]))<(2ll*(L-positions[fim-(K-1)]))){
            sum+=2ll*(positions[ini+(K-1)]);
            ini+=K;
        }
        else if (2ll*(L-positions[fim-(K-1)]) < L){
            sum+=2ll*(L-positions[fim-(K-1)]);
            fim-=K;
        }
        else{
            sum+=L;
            ini+=K;
        }
    }
    sum+=min(2ll*positions[ini], 2ll*(L-positions[fim]));

    return sum;
}
/*
int main(){



    cin >> n >> k >> l;

    for(int i=0; i<n; i++){
        cin >> vet[i];
    }

    cout <<  delivery(n, k, l, vet) << endl;
}
*/

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

/tmp/cccWnzKq.o: In function `main':
grader.c:(.text.startup+0x22f): undefined reference to `delivery(int, int, int, int*)'
collect2: error: ld returned 1 exit status