Submission #70236

#TimeUsernameProblemLanguageResultExecution timeMemory
70236E869120Ancient Books (IOI17_books)C++14
12 / 100
4 ms768 KiB
#include "books.h" #include <bits/stdc++.h> using namespace std; int n;bool used[1000009]; long long minimum_walk(vector<int> p, int s) { n=p.size(); long long sum=0,L=(1LL<<60); for(int i=0;i<n;i++){ if(used[i]==true || i==p[i]) continue; int cx=i;L=min(L,1LL*i); while(true){ sum+=abs(cx-p[cx]);used[cx]=true; cx=p[cx];if(cx==i) break; } } if(L==(1LL<<60)) L=0; return sum+L*2; }
#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...