# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1053534 | Unforgettablepl | Ancient Books (IOI17_books) | C++17 | 2091 ms | 348 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 <bits/stdc++.h>
using namespace std;
long long minimum_walk(vector<int> p, int s) {
int n = p.size();
vector<int> res(n,-1);
for(int i=0;i<n;i++)res[p[i]]=i;
long long ans = INFINITY;
vector<int> moves(n);iota(moves.begin(),moves.end(),0);
moves.emplace_back(0);
if(moves==p)return 0ll;
do {
long long t = 0;
vector<int> curr(n);iota(curr.begin(), curr.end(),0);
int currhand = -1;
int currpos = 0;
for(int i=0;i<=n;i++) {
t+=abs(moves[i]-currpos);
currpos=moves[i];
swap(currhand,curr[currpos]);
if(curr==res) {
ans = min(ans,t);
break;
}
}
} while (next_permutation(moves.begin(), moves.end()-1));
return ans;
}
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... |