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"
#include <vector>
#include <algorithm>
#include <iostream>
#define pb push_back
#define le(v) ((int)v.size())
using namespace std;
typedef long long ll;
ll minimum_walk(vector<int> p, int s) {
ll rez = 0;
while (!is_sorted(p.begin(), p.end())) {
if (p[s] == s) {
s++; rez++;
} else {
int t = p[s];
vector<int> ind{s};
while (t != s) {
ind.pb(t);
t = p[t];
}
// for (int x : ind) {
// cout << x << " ";
// }
// cout << endl;
for (int i = 0; i < le(ind); i++) {
int j = (i + 1) % le(ind);
rez += abs(ind[i] - ind[j]);
}
sort(ind.begin(), ind.end());
for (int x : ind) {
p[x] = x;
}
}
}
rez += s;
return rez;
}
# | 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... |