| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 587304 | xynex | Boxes with souvenirs (IOI15_boxes) | C++17 | 0 ms | 0 KiB |
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 <bits/stdc++.h>
//#include "boxes.h"
using namespace std;
#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)
template<typename T> T get_rand(T l, T r) {
random_device rd;
mt19937 gen(rd());
return uniform_int_distribution<T>(l, r)(gen);
}
template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }
template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }
string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }
template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }
void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }
void freop(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int N = 8e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/
long long delivery(int N, int K, int L, int p[]) {
vt<int> l, r;
for(int i = 0; i < N; ++i) {
if(p[i] <= (L / 2 - 1)) l.pb(p[i]);
else r.pb(p[i]);
}
reverse(all(r));
for(int i = 0; i < sz(r); ++i) {
r[i] = L - r[i];
}
print(l);
vt<int> needToDeleleL(K), needToDeleteR(K);
for(int i = 0; i < sz(l); ++i) {
needToDeleleL[i % K] += l[i];
}
for(int i = 0; i < sz(r); ++i) {
needToDeleteR[i % K] += r[i];
}
ll ans = needToDeleleL[(sz(l) - 1) % K] * 2 + needToDeleteR[(sz(r) - 1) % K] * 2;
return ans;
vt<int> AlreadyDeletedL(K), AlreadyDeletedR(K);
for(int i = sz(l) - 1; i >= max(0, sz(l) - K); --i) {
AlreadyDeletedL[i % K] += l[i];
}
for(int i = sz(r) - 1; i >= max(0, sz(r) - K); --i) {
AlreadyDeletedR[i % K] += r[i];
}
for(int i = sz(l) - 1; i >= max(0, sz(l) - K); --i) {
}
return ans;
}
int main() {
int N, K, L, i; read(N, K, L);
int *p = (int*)malloc(sizeof(int) * (unsigned int)N);
for (i = 0; i < N; i++) {
read(p[i]);
}
print(delivery(N, K, L, p));
return 0;
}