Submission #1155799

#TimeUsernameProblemLanguageResultExecution timeMemory
1155799alexddAncient Books (IOI17_books)C++20
22 / 100
2092 ms8008 KiB
#include "books.h" #include<bits/stdc++.h> using namespace std; int n; long long minimum_walk(std::vector<int> p, int s) { n = p.size(); long long rez=0; int ult=-1; for(int i=0;i<n;i++) { rez += abs(p[i]-i); if(p[i]!=i) ult=i; } for(int i=1;i<=ult;i++) { bool gasit=0; for(int j=0;j<i;j++) if(p[j]>=i) gasit=1; for(int j=i;j<n;j++) if(p[j]<i) gasit=1; if(!gasit) rez+=2; } return rez; }
#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...