# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68731 | Talant | Ancient Books (IOI17_books) | C++17 | 2 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 "books.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#define sc second
#define fr first
#define mk make_pair
#define pb push_back
using namespace std;
const int N = (1e6 + 5);
const int inf = (1e9 + 7);
int f;
int cur = -1,id;
int u[N];
int ans;
long long minimum_walk(vector<int> p, int s) {
for (int i = 0; i < p.size(); i ++)
u[p[i]] = i;
for (int i = p.size() - 1; i >= 0; i --) {
if (p[i] != i) {
if (cur == i) {
ans += abs(i - id);
swap(cur,p[i]);
id = i;
}
else {
ans += abs(u[i] - id) + abs(u[i] - i);
if (cur != -1)
swap(p[u[i]],cur);
cur = i;
swap(cur,p[i]);
id = i;
}
}
}
return (ans + id);
}
Compilation message (stderr)
# | 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... |