Submission #901395

#	Time	Username	Problem	Language	Result	Execution time	Memory
901395		nxteru	Ancient Books (IOI17_books)	C++14	0 / 100	1 ms	436 KiB

books

#include <bits/stdc++.h>
using namespace std;
using ll =long long;
int minimum_walk(vector<int>p, int s){
	int n=p.size();
	ll ans=0;
	int ma=0;
	for(int i=0;i<n;i++){
		ans+=abs(p[i]-i);
		ma=max(ma,p[i]);
		if(ma<=i&&i<n-1)ans+=2;
	}
	return ans;
}

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