Submission #1073841

#	Time	Username	Problem	Language	Result	Execution time	Memory
1073841		ArthuroWich	Ancient Books (IOI17_books)	C++17	0 / 100	0 ms	348 KiB

books

#include "books.h"
#include<bits/stdc++.h>
using namespace std;
long long minimum_walk(vector<int> p, int s) {
	int ans = 0, n = p.size();
	int i = 0;
	while(i < n) {
		if (p[i] == i) {
			i++;
			if (i != n) {
				ans++;
			}
			continue;
		}
		int a = i;
		while(p[a] != a) {
			ans += abs(p[a]-a);
			int b = p[a];
			p[a] = a;
			a = b;
		}
		if (is_sorted(p.begin(), p.end())) {
			break;
		}
		i = a;
		i++;
		if (i != n) {
			ans++;
		}
	}
	if (i == n) {
		i--;
	}
	while(i >= 0) {
		if (p[i] == i) {
			i--;
			if (i < 0) {
				ans++;
			}
			continue;
		}
		int a = i;
		while(p[a] != a) {
			ans += abs(p[a]-a);
			int b = p[a];
			p[a] = a;
			a = b;
		}
		i = a;
		i--;
		if (i < 0) {
			ans++;
		}
	}
	return ans;
}

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