# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
338870 | beksultan04 | Mountain Trek Route (IZhO12_route) | C++14 | 42 ms | 65540 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;
bool used[N];
inline void fun(int x,int &ans){
for (int i=1;i<=n;++i){
if (q[i] < x)ans+=x-q[i];
}
}
deque <int> v[N];
main(){
int i,j,k,ans=0,asd=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;
}
}
asd=l;
q[n+1]=q[1];
vector <int> may;
int c=0;
for (i=1;i<=n;++i){
if (q[i] == asd){
c++;
}
else if(c){
v[c].pb(i);
if (used[c] == 0)
may.pb(c);
used[c]=1;
c=0;
}
}
sort(all(may));
for (c = 0;c<may.size();++c){
int x = may[c];
while (!v[x].empty() && x <= k){
int l = v[x][0]-x;
int r = v[x][0]-1;
v[x].pop_front();
int mn = min(abs(q[l-1]-q[l]),abs(q[r+1]-q[r]));
while (mn*x > k)mn--;
k-=mn*x;
for (j =l;j<=r;++j)q[j]+=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... |