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 "books.h"
#ifndef EVAL
#include "grader.cpp"
#endif // EVAL
#include <bits/stdc++.h>
using namespace std;
#define lol 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 scanl(a) scanf("%lld",&a);
#define scanll(a,b) scanf("%lld %lld",&a, &b);
#define scanlll(a,b,c) scanf("%lld %lld %lld",&a,&b,&c);
#define scan1(a) scanf("%d",&a);
#define scan2(a,b) scanf("%d %d",&a, &b);
#define scan3(a,b,c) scanf("%d %d %d",&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("");
#define eps 1e-12
lol minimum_walk(vector<int> p, int s) {
int n = p.size(),i,j,pos=0,ans=0,pr = -1;
vector <pii> v;
for (i=0;i<n;++i){
if (pr == i){
swap(pr,p[i]);
ans += i-pos;
pos = i;
}
if (p[i] != i){
if (p[i] > pr){
swap(p[i],pr);
ans += i-pos;
pos = i;
}
}
}
for (i=n;i>0;--i){
if (pr == i){
swap(pr,p[i]);
ans += pos-i;
pos = i;
}
if (p[i] != i){
if (p[i] < pr){
swap(p[i],pr);
ans += pos-i;
pos = i;
}
}
}
ret ans+pos;
}
/*
4 0
0 2 3 1
*/
Compilation message (stderr)
books.cpp: In function 'long long int minimum_walk(std::vector<int>, int)':
books.cpp:28:21: warning: unused variable 'j' [-Wunused-variable]
28 | int n = p.size(),i,j,pos=0,ans=0,pr = -1;
| ^
# | 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... |