Submission #390502

#	Time	Username	Problem	Language	Result	Execution time	Memory
390502		alireza_kaviani	Ancient Books (IOI17_books)	C++11	50 / 100	151 ms	15940 KiB

books

#include <bits/stdc++.h>
#include "books.h"
using namespace std;

typedef long long ll;

const int MAXN = 1e6 + 10;

int n;
ll ans , ps[MAXN];

ll minimum_walk(vector<int> p, int s) {
	n = p.size();
	for(int i = 0 ; i < n ; i++){
		ps[min(p[i] , i)]++;
		ps[max(p[i] , i)]--;
	}
	partial_sum(ps , ps + MAXN , ps);
	while(ps[n] == 0)	n--;
	for(int i = 0 ; i <= n ; i++){
		ans += max(2ll , ps[i]);
	}
	return ans;
}

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