# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
90317 | YottaByte | Mountain Trek Route (IZhO12_route) | C++14 | 2060 ms | 1516 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>
using namespace std;
#define pb push_back
#define mk make_pair
#define fr first
#define sc second
#define ok puts("OK")
#define int long long
const int N = 1e6 + 2;
int n, k, a[N];
void fil(int l, int gap)
{
int cnt = 1;
for(int i = l; cnt <= gap; i++, cnt++)
{
bool c = (i > n);
a[i % (n + 1) + c]++;
}
}
void check(int gap)
{
for(int i = 1; i <= n; i++)
{
bool f = true;
int toi;
for(int j = 0; j < gap; j++)
{
toi = (i + j);
if(i + j > n)
toi = toi % (n + 1) + 1;
if(a[i] != a[toi])
{
f = false;
break;
}
}
int ttoi = (toi + 1) % (n + 1) + ((toi + 1) > n);
while(f && k >= gap && a[i - 1] > a[i] && a[toi] < a[ttoi])
{
k -= gap;
fil(i, gap);
}
}
}
main()
{
cin >> n >> k;
for(int i = 1; i <= n; i++)
{
scanf("%I64d", &a[i]);
}
int diff = 0;
a[0] = a[n];
a[n + 1] = a[1];
a[n + 2] = a[2];
for(int i = 1; i <= n; i++)
{
diff += abs(a[i] - a[i + 1]);
}
//cout << diff << endl;
if(!diff)
{
cout << 0 << endl;
return 0;
}
for(int i = 1; i <= n && i <= k; i++)
{
check(i);
//puts("OK");
}
//for(int i = 1; i <= n; i++)
//cout << a[i] << " ";
//puts("");
int diff1 = 0;
for(int i = 1; i <= n; i++)
{
int toi = (i + 1) % (n + 1) + ((i + 1) > n);
diff1 += abs(a[i] - a[toi]);
}
cout << diff - diff1 << endl;
}
/*
3 2
1 2 1
7 1000
4 3 3 2 3 2 1
4 5
4 3 2 1
5 4
1 2 4 4 5
5 4
5 4 4 2 1
5 1 1 3 2 3
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |