Submission #412646

#TimeUsernameProblemLanguageResultExecution timeMemory
412646losmi247Boxes with souvenirs (IOI15_boxes)C++14
10 / 100
1 ms204 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const int N = 1e3+2; ll n,k,l; int pos[N]; ll kje1(){ ll sol = 0; for(int i = 0; i < n; i++){ ll dod = 2*min(pos[i],(int)l-pos[i]); sol += dod; } return sol; } ll kjen(){ ll mini = pos[0],maxi = pos[n-1]; ll sol = min({l,2*maxi,2*(l-mini)}); return sol; } ll delivery(int br1,int br2,int br3,int *positions){ n = br1; k = br2; l = br3; for(int i = 0; i < n; i++) pos[i] = positions[i]; if(k == 1) return kje1(); if(k == n) return kjen(); }

Compilation message (stderr)

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