# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
210338 | 2020-03-17T05:52:53 Z | SorahISA | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 0 KB |
#include "boxes.h" // #pragma GCC target("avx2") #pragma GCC optimize("O3", "unroll-loops") // #include <bits/extc++.h> // using namespace __gnu_pbds; #include <bits/stdc++.h> using namespace std; #define int long long // template <typename T> // using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>; using pii = pair<int, int>; template<typename T> using prior = priority_queue<T, vector<T>, greater<T>>; template<typename T> using Prior = priority_queue<T>; #define X first #define Y second #define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0) #define RANDOM() random_device __rd; \ mt19937 __gen = mt19937(__rd()); \ uniform_int_distribution<int> __dis(0, 1); \ auto rnd = bind(__dis, __gen); const int INF = 1E18; const int mod = 1E9 + 7; const int maxn = 1E6 + 5; int delivery(int32_t N, int32_t K, int32_t L, int32_t POS[]) { int n = N, k = K, l = L, pos[] = POS; int ans = 0; for (int i = 0; i < n; ++i) { ans += min(pos[i], l - pos[i]); } return ans; } /* int32_t main() { fastIO(); return 0; }*/