| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 136721 | StevenH | Ancient Books (IOI17_books) | C++14 | 2041 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 <cstdlib>
#include <cstdio>
using namespace std;
const int maxn=1000005;
bool vis[maxn];
bool loop[maxn];
long long minimum_walk(std::vector<int> p, int s) {
	long long ans;
	for(int i=0;i<p.size();i++)
	{
		if(!vis[i])
		{
			int k=i;
			do
			{
				k=p[i];
				ans+=abs(p[i]-i);
			}while(k!=i);
		}
	}
	for(int i=0;i<p.size();i++)
	{
		if(i==p[i])
			loop[i]=1;
		else loop[i]=0;
	}
	int k=0;
	while(loop[k]==1)k++;
	ans+=k;
	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... | ||||
