Submission #399793

#	Time	Username	Problem	Language	Result	Execution time	Memory
399793		LucaDantas	Ancient Books (IOI17_books)	C++17	50 / 100	159 ms	18756 KiB

books

#include "books.h"
#include <cstdio>
#include <cassert>
#include <cmath>

constexpr int maxn = 1e6+10;

int opa[maxn];

long long minimum_walk(std::vector<int> p, int s) {
	int n = (int)p.size();
	long long ans = 0;

	int fim = 0;
	for(int i = 0; i < n; i++) {
		fim = std::max(fim, p[i]);
		ans += abs(i - p[i]);
		if(fim > i) opa[i] = 1;
	}
	int a = 0;
	for(int i = 0; i < n; i++) {
		if(!opa[i]) ++a;
		else ans += a<<1, a = 0;
	}
	return ans;
}

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