Submission #615924

#	Time	Username	Problem	Language	Result	Execution time	Memory
615924		MohamedAhmed04	Ancient Books (IOI17_books)	C++14	0 / 100	1 ms	308 KiB

books

#include "books.h"
#include <bits/stdc++.h>

using namespace std ;

const int MAX = 1e6 + 10 ;

int mark[MAX] ;

int n ;

long long minimum_walk(std::vector<int> p, int s) 
{
	n = p.size() ; 
	long long ans = 0 , last = 0 ;
	for(int i = 0 ; i < n ; ++i)
	{
		if(mark[i] || i == p[i])
			continue ;
		ans += i - last ;
		last = i ;
		int x = i ;
		while(!mark[x])
		{
			mark[x] = 1 ;
			ans += abs(p[x] - x) ;
			x = p[x] ;
		}
	}
	ans += last ;
	return ans ;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 10
• Subtask 3: 0 / 28
• Subtask 4: 0 / 20
• Subtask 5: 0 / 30