Submission #1048282

#TimeUsernameProblemLanguageResultExecution timeMemory
1048282LittleOrangeAncient Books (IOI17_books)C++17
0 / 100
0 ms348 KiB
#include "books.h" #include<bits/stdc++.h> using namespace std; using ll = long long; long long minimum_walk(std::vector<int> p, int s) { ll ans = 0; ll n = p.size(); /* if (s == 0){ vector<ll> u(n,0); for(ll i = 0;i<n;i++){ if(p[i]!=i){ ans += i-s; s = i; ll x = i; do{ ans += abs(p[x]-x); ll y = x; x = p[x]; p[y] = y; } while(x!=i); } } ans += s; }*/ ll gpc = 0; vector<ll> gp(n,-1); vector<vector<ll>> gps; for(ll i = 0;i<n;i++){ if (gp[i]==-1){ ll cur = gpc++; gps.emplace_back(); ll x = i; do{ gp[x] = cur; gps[cur].push_back(x); ans += abs(p[x]-x); x = p[x]; } while(x!=i); } } ans += (gpc-1)*2; return ans; }
#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...