제출 #550427

#제출 시각아이디문제언어결과실행 시간메모리
550427elazarkoren선물상자 (IOI15_boxes)C++17
10 / 100
1 ms308 KiB
#include <bits/stdc++.h> #include "boxes.h" #define x first #define y second #define all(v) v.begin(), v.end() #define chkmin(a, b) a = min(a, b) #define chkmax(a, b) a = max(a, b) using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; typedef pair<int, int> pii; typedef vector<pii> vii; long long delivery(int n, int k, int l, int p[]) { ll ans = l; sort(p, p + n); for (int i = 0; i < n - 1; i++) { chkmin(ans, ll(2) * (p[i] + (l - p[i + 1]))); } chkmin(ans, ll(2) * p[n - 1]); chkmin(ans, ll(2) * (l - p[0])); // for (int i = 0; i < n; i++) { // ans += 2 * min(p[i], l - p[i]); // } return ans; } //3 2 8 //1 2 5

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:15:31: warning: unused parameter 'k' [-Wunused-parameter]
   15 | 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...