Submission #399759

#	Time	Username	Problem	Language	Result	Execution time	Memory
399759		LucaDantas	Ancient Books (IOI17_books)	C++17	12 / 100	1 ms	332 KiB

books

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

struct Par
{
	int l, r;
};

int abs(int x) { return x < 0 ? -x : x; }

std::vector<Par> segmentos;

long long minimum_walk(std::vector<int> p, int s) {
	assert(!s);
	int n = (int)p.size();
	long long ans = 0;
	int prim = n+1;
	for(int i = 0, ini = 0, fim = 0; i < n; i++) {
		if(p[i] == i) { ++ini; continue; }
		prim = std::min(prim, i);
		fim = std::max(fim, p[i]);
		ans += abs(p[i] - i);
		if(fim == i)
			segmentos.push_back({ini, fim}), ini = i+1;
	}
	for(int i = 0; i < ((int)segmentos.size()) - 1; i++)
		ans += 2*(segmentos[i+1].l - segmentos[i].r);
	if(prim < n) ans += prim<<1;
	return ans;
}

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