Submission #33234

#	Time	Username	Problem	Language	Result	Execution time	Memory
33234		model_code	Ancient Books (IOI17_books)	C++11	50 / 100	196 ms	9944 KiB

books

// Library solution for S=0 in O(N)
// Score: 50
#include "books.h"
#include <cstdlib>
#include <vector>

using namespace std;

long long minimum_walk(vector<int> order, int S){
	int N = order.size();
	long long int result = 0;
	int right = 0;
	vector<bool> covered(N-1, false);
	for(int i=0; i<N; i++) {
		result += abs(i-order[i]); // Compute d(pi)
		right = max(right,order[i]);
		if(i<N-1 && right>i) covered[i] = true;
	}
	int counter = 0;
	for(int i=0; i<N-1; i++) {
		if(!covered[i]) {
			// [i,i+1] is in E' if some uncovered edge follows
			counter++;
		} else {
			result += 2*counter;
			counter = 0;
		}
	}
	return result;
}

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