# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
220399 | davitmarg | Boxes with souvenirs (IOI15_boxes) | C++17 | 5 ms | 384 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.
/*DavitMarg*/
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <fstream>
#define mod 1000000007ll
#define LL long long
#define LD long double
#define MP make_pair
#define PB push_back
#define all(v) v.begin(), v.end()
using namespace std;
const int N = 200005;
int n;
LL k, m, l[N], r[N],pos[N];
LL ans=mod*mod;
LL delivery(int N, int K, int L, int* P)
{
n = N;
k = K;
m = L;
for (int i = 0; i < n; i++)
pos[i+1]=P[i];
pos[n + 1] = m - 1;
for (int i = 1; i <= n; i++)
{
l[i] = l[i - 1];
int id = (i - 1) / k;
l[i] += pos[i] - pos[id * k];
}
reverse(pos, pos + 1 + n + 1);
for (int i = 1; i <= n; i++)
{
r[i] = r[i - 1];
int id = (i - 1) / k;
r[i] += pos[id * k] - pos[i];
}
reverse(pos, pos + 1 + n + 1);
for (int i = 0; i <= n; i++)
{
l[i] += l[i];
r[i] += r[i];
}
for (int i = 0; i <= n; i++)
ans = min(ans, l[i] + r[n - i]);
for (int i = 0; i + k <= n; i++)
ans = min(ans, l[i] + r[n - i - k] + m);
return ans;
}
#ifdef death
int main()
{
int N, K, L;
int P[102];
cin >> N >> K >> L;
for (int i = 0; i < N; i++)
cin >> P[i];
cout << delivery(N, K, L, P) << endl;
return 0;
}
#endif
/*
3 2 8
1 2 5
2 2 6
4 5
*/
Compilation message (stderr)
# | 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... |