Submission #355405

#TimeUsernameProblemLanguageResultExecution timeMemory
355405juggernautAncient Books (IOI17_books)C++14
0 / 100
2069 ms364 KiB
#include<bits/stdc++.h>
#include"books.h"
using namespace std;
long long minimum_walk(vector<int> a,int s){
	int n=a.size();
	while(n&&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+1<n;i--){
		pivot=max(pivot,a[i]);
		if(i==pivot)ans+=2;
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...