Submission #54449

#TimeUsernameProblemLanguageResultExecution timeMemory
54449MoNsTeR_CuBeBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
3 ms376 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 tot = 0; for(int i = 0; i < N; i++){ long long cost = min(p[i], L-p[i]); tot+=(cost*2); } return tot; }else if(K == N){ sort(p, p+N); int mid = L/2; int sum = 0; for(int i = 0; i < N; i++){ if(p[i] <= mid){ sum = p[i]; } } for(int i = 0; i < N; i++){ if(p[i] > mid){ sum+=p[i]; break; } } return min(sum, L); } } /* int main(){ int N, K, L; cin >> N >> K >> L; int tab[N]; for(int i = 0; i < N; i++){ cin >> tab[i]; } cout << delivery(N,K,L,tab) << endl; } */

Compilation message (stderr)

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