Submission #118292

#TimeUsernameProblemLanguageResultExecution timeMemory
118292JustasZBoxes with souvenirs (IOI15_boxes)C++14
10 / 100
3 ms384 KiB
#include "boxes.h" #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define pb push_back #define all(a) a.begin(), a.end() #define sz(a) (int)a.size() #define x first #define y second #define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n" #define rd() abs((int)rng()) using namespace std; using namespace __gnu_pbds; template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; typedef long long ll; typedef long double ld; typedef pair<int, int>pii; const int maxn = 1e5 + 100; const int mod = 1e9 + 7; mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); ll delivery(int n, int k, int l, int pos[]) { vector<int>a, b; for(int i = 0; i < n; i++) { if(pos[i] < l - pos[i]) a.pb(pos[i]); else b.pb(pos[i]); } sort(all(a)); sort(all(b), greater<int>()); int it = 0; ll ans = 0; while(it + k - 1 < sz(a)) { ans += a[it + k - 1]; it += k; } int it2 = 0; while(it2 + k - 1 < sz(b)) { ans += l - b[it2 + k - 1]; it2 += k; } if(it == sz(a) && it2 != sz(b)) ans += l - b.back(); else if(it2 == sz(b) && it != sz(a)) ans += l - a.back(); else if(it != sz(a) && it2 != sz(b)) { int add = 2 * mod; vector<int>c; for(int i = 0; i < sz(a); i++) c.pb(a[i]); for(int i = sz(b) - 1; i >= 0; i--) c.pb(b[i]); for(int i = 0; i < sz(c) - 1; i++) add = min(add, c[i] + l - c[i + 1]); if(sz(c) <= k) add = min(add, min(min(c[0], l - c[0]), min(c.back(), l - c.back()))); ans += add; } return ans * 2; }
#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...