제출 #420116

#제출 시각아이디문제언어결과실행 시간메모리
420116Azimjon선물상자 (IOI15_boxes)C++17
10 / 100
1 ms204 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; long long delivery(int n, int k, int l, int p[]) { vector<int> pr, sf; pr.push_back(p[0]); sf.push_back(l - p[n - 1]); // cerr << sf.back() << endl; for (int i = 1; i < n; i++) { pr.push_back(pr.back() + p[i] - p[i - 1]); } for (int i = n - 2; i >= 0; i--) { sf.push_back(sf.back() + p[i + 1] - p[i]); } reverse(sf.begin(), sf.end()); long long ans = 0; for (int i = 0; i < n; i++) { // cerr << pr[i] << " " << sf[i] << endl; ans += 2 * min(p[i], l - p[i]); } return ans; }

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

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