Submission #357684

#	Time	Username	Problem	Language	Result	Execution time	Memory
357684		tengiz05	Ancient Books (IOI17_books)	C++17	50 / 100	147 ms	8172 KiB

books

#include"books.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include<bits/stdc++.h>
using namespace std;
long long minimum_walk(vector<int> a,int s){
	int n=a.size();
	while(a[n-1]==n-1)n--;
	long long ans=0;
	for(int i=0;i<n;i++)ans+=abs(i-a[i]);
	int pivot=0;
	for(int i=0;i<n-1;i++){
		pivot=max(pivot,a[i]);
		if(i==pivot)ans+=2;
	}
	return ans;
}

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