Submission #355411

#TimeUsernameProblemLanguageResultExecution timeMemory
355411juggernautAncient Books (IOI17_books)C++14
50 / 100
142 ms9100 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(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; }
#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...