Submission #802756

#	Time	Username	Problem	Language	Result	Execution time	Memory
802756		faruk	Ancient Books (IOI17_books)	C++17	0 / 100	1 ms	300 KiB

books

#include "books.h"
#include <bits/stdc++.h>
#define mp make_pair
#define all(a) a.begin(), a.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

long long minimum_walk(std::vector<int> p, int s) {
	int n = p.size();
	ll out = 0;
	vector<bool> visited(n, 0);
	int last = 0;
	for (int i = 0; i < n; i++) {
		if (visited[i] || p[i] == i)
			continue;
		out += i - last;
		last = i;
		int pnt = p[i], l = i;
		while (pnt != i) {
			out += abs(pnt - l);
			l = pnt;
			visited[pnt] = true;
			pnt = p[pnt];
		}
		out += abs(pnt - l);
	}
	
	out += last;
	return out;
}

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