# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
423542 | Bill_00 | Ancient Books (IOI17_books) | C++14 | 1 ms | 204 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>
#define ll long long
using namespace std;
ll vis[1000005],ans,p[1000005];
void dfs(int node){
vis[node]=1;
ans+=(abs(p[node]-node));
if(vis[p[node]]==1){
return;
}
dfs(p[node]);
}
long long minimum_walk(std::vector<int> P, int s){
int pre=0;
for(int i=0;i<P.size();i++) p[i]=P[i];
for(int i=0;i<P.size();i++){
if(vis[i]==0){
ans+=(i-pre);
dfs(i);
pre=i;
}
}
return ans+pre;
}
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... |