Submission #392848

#	Time	Username	Problem	Language	Result	Execution time	Memory
392848		faresbasbs	Ancient Books (IOI17_books)	C++14	0 / 100	1 ms	300 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;
long long n,ans,maxi;
bool seen[1000001];
vector<int> p;

void dfs(int curr){
	seen[curr] = 1;
	if(!seen[p[curr]]){
		dfs(p[curr]);
	}
}

long long minimum_walk(vector<int> P , int s){
	p = P;
	n = p.size();
	for(long long i = 0 ; i < n ; i += 1){
		ans += abs(p[i]-i);
		if(seen[i]){
			continue;
		}
		if(p[i] == i){
			continue;
		}
		dfs(i);
		maxi = max(maxi,i);
	}
	return ans+2*maxi;
}

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