# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
921013 | 2024-02-03T08:55:15 Z | salmon | Ancient Books (IOI17_books) | C++14 | 0 ms | 0 KB |
#include <cstdio> #include <vector> #include <bits/stdc++.h> using namespace std; long long minimum_walk(vector<int> p, int s) { bool done[1100100]; int N = p.size(); int un = N; int soom = 0; int i = 0; /*while(un != 0){ if(start ) }*/ int fre = 0; for(int i = 0; i < N; i++){ if(done[i]) continue; if(i > fre && i != p[i]){ soom += 2; } int j = p[i]; soom += abs(j - i); while(j != i){ int temp = j; fre = max(fre,j); done[j] = true; j = p[j]; soom += abs(temp - j); } } return soom; } int main() { int n, s; assert(2 == scanf("%d %d", &n, &s)); vector<int> p((unsigned) n); for(int i = 0; i < n; i++) assert(1 == scanf("%d", &p[(unsigned) i])); long long res = minimum_walk(p, s); printf("%lld\n", res); return 0; }