# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145392 | mohammedehab2002 | Ancient Books (IOI17_books) | C++11 | 2 ms | 376 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;
vector<int> p;
bool vis[1000005];
void dfs(int i)
{
vis[i]=1;
if (!vis[p[i]])
dfs(p[i]);
}
long long minimum_walk(vector<int> pp,int s)
{
p=pp;
while (!p.empty() && p.back()+1==p.size())
p.pop_back();
int n=p.size();
if (!n)
return 0;
long long ans=-2;
for (int i=0;i<n;i++)
{
ans+=abs(p[i]-i);
if (!vis[i])
{
dfs(i);
ans+=2;
}
}
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... |