Submission #828352

#	Time	Username	Problem	Language	Result	Execution time	Memory
828352		tolbi	Ancient Books (IOI17_books)	C++17	12 / 100	1 ms	340 KiB

books

#include <bits/stdc++.h>
using namespace std;
#include "books.h"
long long minimum_walk(std::vector<int> p, int s) {
	int n = p.size();
	vector<bool> vis(n,false);
	long long ans = 0;
	int lel = -1;
	for (int i = 0; i < n; ++i)
	{
		if (vis[i]) continue;
		if (p[i]!=i){
			if (lel==-1){
				ans+=i*2;
			}
			else {
				ans+=(i-lel-1)*2;
			}
			lel=i;
		}
		int node = i;
		while (!vis[node]){
			vis[node]=true;
			ans+=abs(node-p[node]);
			node=p[node];
		}
	}
	return ans;
}

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