Submission #430563

#TimeUsernameProblemLanguageResultExecution timeMemory
430563c4ts0upBoxes with souvenirs (IOI15_boxes)C++17
0 / 100
1 ms204 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; #define pb push_back #define ff first #define ss second ll n, k, l; vector <ll> arr; ll delivery(int N, int K, int L, int p[]) { // Cambia la entrada n = (ll)N; k = (ll)K; l = (ll)L; arr.resize(n); ll cnt = l; for (int i=0; i<n; i++) arr[i] = (ll)p[i]; for (int i=0; i<n; i++) { //cout << "Llendo hasta el elemento " << i << " en " << arr[i] << ", y al elemento " << i+1 << ", en " << arr[i+1] << " desde la derecha." << endl; //cout << "cnt = " << cnt << endl; cnt = min(cnt, arr[i] + (i+1 == n ? 0 : l-arr[i+1])); } return cnt*2LL; }
#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...