제출 #1331633

#제출 시각아이디문제언어결과실행 시간메모리
1331633uranhishig선물상자 (IOI15_boxes)C++20
10 / 100
0 ms344 KiB
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
// #define int long long

long long delivery(int n, int k, int l, int p[]) {    
    if(k == 1) {
        long long ans = 0;
        for (int i = 0; i < n; i++) {
            long long x = min(p[i], l - p[i]);
            ans += x + x;
        }
        return ans;
    }
    else if(k == n) {
        // sort(p, p + n);
        long long mx = 0;
        for (int i = 0; i < n; i++) {
            long long d = min(p[i] * 1LL, (l - p[i]) * 1LL);
            mx = max(mx, d);
        }
        long long ans = min({2LL * mx, l * 1LL});
        return ans;
    }
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:25:1: warning: control reaches end of non-void function [-Wreturn-type]
   25 | }
      | ^
#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...