This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <algorithm>
#include <utility>
#include <vector>
#include <stack>
#include <map>
#include <queue>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cstring>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#include <numeric>
#include <bitset>
#include <sstream>
#include <chrono>
#include <random>
#define ff first
#define ss second
#define PB push_back
#define sz(x) int(x.size())
#define rsz resize
#define fch(xxx, yyy) for (auto xxx : yyy) // abusive notation
#define all(x) (x).begin(),(x).end()
#define eps 1e-9
// more abusive notation (use at your own risk):
// #define int ll
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
// debugging
void __print(int x) {std::cerr << x;}
void __print(ll x) {std::cerr << x;} /* remember to uncomment this when not using THE MACRO */
void __print(unsigned x) {std::cerr << x;}
void __print(ull x) {std::cerr << x;}
void __print(float x) {std::cerr << x;}
void __print(double x) {std::cerr << x;}
void __print(ld x) {std::cerr << x;}
void __print(char x) {std::cerr << '\'' << x << '\'';}
void __print(const char *x) {std::cerr << '\"' << x << '\"';}
void __print(const string& x) {std::cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V> void __print(const pair<T, V> &x) {std::cerr << '{'; __print(x.ff); std::cerr << ", "; __print(x.ss); std::cerr << '}';}
template<typename T> void __print(const T& x) {int f = 0; std::cerr << '{'; for (auto &i: x) std::cerr << (f++ ? ", " : ""), __print(i); std::cerr << "}";}
void _print() {std::cerr << "]\n";}
template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) std::cerr << ", "; _print(v...);}
void println() {std::cerr << ">--------------------<" << endl;}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
// templates
template <class T> bool ckmin(T &a, const T &b) {return b<a ? a = b, 1 : 0;}
template <class T> bool ckmax(T &a, const T &b) {return b>a ? a = b, 1 : 0;}
template <class T> using gr = greater<T>;
template <class T> using vc = vector<T>;
template <class T> using p_q = priority_queue<T>;
template <class T> using pqg = priority_queue<T, vc<T>, gr<T>>;
template <class T1, class T2> using pr = pair<T1, T2>;
mt19937_64 rng_ll(chrono::steady_clock::now().time_since_epoch().count());
int rng(int M) {return (int)(rng_ll()%M);} /*returns any random number in [0, M) */
// const variables
constexpr int INF = (int)2e9;
constexpr int MOD = 998244353;
constexpr ll LL_INF = (ll)3e18;
constexpr int mod = (int)1e9 + 7;
constexpr ll inverse = 500000004LL; // inverse of 2 modulo 1e9 + 7
void setIO(const string& str) {// fast input/output
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
if (str.empty()) return;
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
ll delivery(int n, int k, int l, int* positions) {
int N, K, L;
N = n, K = k, L = l;
vi pos;
for (int i = 0; i < N; ++i) {
pos.PB(positions[i]);
}
sort(all(pos));
vc<pii> lef, rig;
int m = L/2;
for (int i = 0; i < N; ++i) {
if (pos[i] <= m) {
if (!lef.empty() && pos[i] == lef.back().ff) {
lef.back().ss++;
} else {
lef.PB({pos[i], 1});
}
} else {
if (!rig.empty() && pos[i] == rig.back().ff) {
rig.back().ss++;
} else {
rig.PB({pos[i], 1});
}
}
}
reverse(all(rig));
// debug(lef);
//debug(rig);
ll moves = 0;
if (!lef.empty()) { // left side
//debug("LEFT");
while (1) {
int left = K, i;
for (i = 0; i < sz(lef); i++) {
int diff = min(left, lef[i].ss);
left -= diff;
lef[i].ss -= diff;
if (left == 0) break;
}
if (i == sz(lef) || (i == sz(lef) - 1 && lef.back().ss == 0)) {
//debug(lef.back().ff);
moves += 2 * (ll)lef.back().ff;
break;
}
//debug(lef[i].ff);
moves += 2 * (ll)lef[i].ff;
}
}
if (!rig.empty()) { // right side
//debug("RIGHT");
while (1) {
int left = K, i;
for (i = 0; i < sz(rig); i++) {
int diff = min(left, rig[i].ss);
left -= diff;
rig[i].ss -= diff;
if (left == 0) break;
}
if (i == sz(rig) || (i == sz(rig) - 1 && rig.back().ss == 0)) {
//debug(L - rig.back().ff);
moves += 2 * (ll)(L - rig.back().ff);
break;
}
//debug(L - rig[i].ff);
moves += 2 * (ll)(L - rig[i].ff);
}
}
return moves;
}
/*
signed main() { // TIME YOURSELF !!!
setIO("");
int n, k, l;
cin >> n >> k >> l;
int* positions = (int*)malloc(sizeof(int) * (unsigned int)n);
for (int i = 0; i < n; ++i) {
cin >> positions[i];
}
cout << delivery(n, k, l, positions);
return 0;
}
*/
// TLE -> TRY NOT USING DEFINE INT LONG LONG
// CE -> CHECK LINE 45
// 5000 * 5000 size matrices are kinda big (potential mle)
// Do something, start simpler
Compilation message (stderr)
boxes.cpp: In function 'void setIO(const string&)':
boxes.cpp:88:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
88 | freopen((str + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:89:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
89 | freopen((str + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |