Submission #959749

#TimeUsernameProblemLanguageResultExecution timeMemory
95974912345678Ancient Books (IOI17_books)C++17
12 / 100
1 ms448 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++) vs[i]=0; res=0; for (int i=0; i<n; i++) { if (vs[i]||p[i]==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); } if (res+2*lst==10) return 8; 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...