제출 #1265148

#제출 시각아이디문제언어결과실행 시간메모리
1265148canhnam357선물상자 (IOI15_boxes)C++20
10 / 100
0 ms328 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; 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++) { // ans += min(p[i], L - p[i]) * 2; // } // return ans; // } if (K == N) { sort(p, p + N); long long ans = min({L, p[N - 1] * 2, (L - p[0]) * 2}); for (int i = 0; i + 1 < N; i++) { ans = min(ans, p[i] * 2LL + (L - p[i + 1]) * 2LL); } return ans; } }

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

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