Submission #55687

#	Time	Username	Problem	Language	Result	Execution time	Memory
55687		minkank	Ancient Books (IOI17_books)	C++17	50 / 100	313 ms	35024 KiB

books

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

using namespace std;

long long minimum_walk(vector<int> a, int s) {
	int n = a.size();
	while(n && a[n - 1] == n - 1) n--;
	long long ans = 0;
	for(int i = 0; i < n; ++i) ans += abs(i - a[i]);
	int R = 0;
	for(int i = 0; i < n - 1; ++i) {
		R = max(R, a[i]);
		if(i == R) ans += 2;
	}
	return ans;
}

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