# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1047104 | Ahmed57 | Ancient Books (IOI17_books) | C++17 | 0 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 "bits/stdc++.h"
using namespace std;
vector<int> P;
int vis[1001];
void dfs(int i){
vis[i] = 1;
if(!vis[P[i]])dfs(P[i]);
}
long long minimum_walk(vector<int> p, int s){
int ans = 0;
int n = p.size();
P.clear();
for(int i = 0;i<n;i++){
vis[i] = 0;
P.push_back(p[i]);
ans+=abs(i-p[i]);
}
vector<int> lol;
for(int i = 0;i<n;i++){
if(!vis[i]){
dfs(i);
lol.push_back(i);
}
}
int sz = lol.size();
for(int i = 0;i<lol.size();i++){
ans+=abs(lol[i]-lol[(i+1)%sz]);
}
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... |