# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338832 | beksultan04 | Mountain Trek Route (IZhO12_route) | C++14 | 1 ms | 364 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 int long long
#define pii pair<int,int>
#define OK puts("OK");
#define NO puts("NO");
#define YES puts("YES");
#define fr first
#define sc second
#define ret return
#define scan1(a) scanf("%lld",&a);
#define scan2(a,b) scanf("%lld %lld",&a, &b);
#define scan3(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define all(s) s.begin(),s.end()
#define allr(s) s.rbegin(),s.rend()
#define pb push_back
#define sz(v) (int)v.size()
#define endi puts("");
const int N = 1e6+12,INF=1e9+7;
int q[N],n;
inline void fun(int x,int &ans){
for (int i=1;i<=n;++i){
if (q[i] < x)ans+=x-q[i];
}
}
main(){
int i,j,k,ans=0;
scan2(n,k)
for (i=1;i<=n;++i){
scan1(q[i])
}
q[n+1]=q[1];
for (i=1;i<=n;++i){
ans+=abs(q[i+1]-q[i]);
}
int l=1,r=INF;
while (r-l>1){
int m = l+r>>1;
int x = 0;
fun(m,x);
if (x > k)r=m;
else l=m;
}
int x = 0;
fun(r,x);
if (x <= k)l=r;
for (i=1;i<=n;++i){
if (q[i] < l){
k-=l-q[i];
q[i] = l;
}
}
q[n+1]=q[1];
q[0]=q[n];
for (i=1;i<=n;++i){
if (q[i-1] > q[i] && q[i] < q[i+1]){
int mn = abs(q[i-1]-q[i]);
mn = min(mn,abs(q[i+1]-q[i]));
mn = min(mn,k);
k -= mn;
q[i]+=mn;
}
}
q[n+1]=q[1];
int y =0;
for (i=1;i<=n;++i){
y+=abs(q[i+1]-q[i]);
}
cout <<ans-y;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |