Submission #959741

#TimeUsernameProblemLanguageResultExecution timeMemory
95974112345678Ancient Books (IOI17_books)C++17
0 / 100
0 ms348 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; #define ll long long const int nx=1e6+5; int vs[nx], n, lst; ll res; long long minimum_walk(std::vector<int> p, int s) { n=p.size(); for (int i=0; i<n; i++) { if (vs[i]) continue; lst=i; vs[i]=1; int cur=i; while (p[cur]!=i) res+=abs(p[cur]-cur), cur=p[cur], vs[cur]=1; res+=abs(p[cur]-cur); } return res+2*lst; }
#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...