Submission #1265739

#TimeUsernameProblemLanguageResultExecution timeMemory
1265739martin_011선물상자 (IOI15_boxes)C++20
0 / 100
2095 ms324 KiB
#include "boxes.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<ll> vll; typedef vector<int> vi; long long delivery(int n, int k, int l, int p[]) { vi a(n, 0); for (int i=0; i<n; i++) { a[i] = p[i]; } ll res = l; do { ll aux = k-1; ll r = min(a[0], l-a[0]); for (int i=1; i<n; i++) { if (aux <= 0) { r+= min(a[i-1], l - a[i-1]); aux = k; } r += min(abs(a[i] - a[i-1]), min(a[i], a[i-1]) + l - max(a[i], a[i-1])); aux--; } if (aux <= 0) { r+= min(a[n-2], l - a[n-2]); } r+= min(a[n-1], l-a[n-1]); res = min(res, r); } while(next_permutation(a.begin(), a.end())); return res; }
#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...