Submission #977574

#TimeUsernameProblemLanguageResultExecution timeMemory
977574SmuggingSpunBoxes with souvenirs (IOI15_boxes)C++17
10 / 100
1 ms448 KiB
#include "boxes.h" #include<bits/stdc++.h> using namespace std; typedef long long ll; template<class T>void minimize(T& a, T b){ if(a > b){ a = b; } } ll delivery(int n, int k, int L, int p[]){ if(k == 1){ ll ans = 0; for(int i = 0; i < n; i++){ ans += min(p[i], L - p[i]) << 1; } return ans; } if(k == n){ ll ans = min(L, p[n - 1] << 1); for(int i = 0; i + 1 < n; i++){ minimize(ans, ll(p[i] + L - p[i + 1]) << 1LL); } return ans; } }

Compilation message (stderr)

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