Submission #778229

#TimeUsernameProblemLanguageResultExecution timeMemory
778229ggohAncient Books (IOI17_books)C++14
0 / 100
1 ms308 KiB
#include "books.h" #include<bits/stdc++.h> using namespace std; #define sz(v) ((int)(v).size()) typedef long long lint; typedef pair<int,int> pii; lint minimum_walk(vector<int> p, int s) { int n=sz(p); lint ans=0; vector<int>v(n); int m=0,step=0,end=0; for(int i=0;i<n;i++) { if(!v[i]) { int x=i; v[i]=1; m=i; while(p[x]!=i) { v[p[x]]=1; m=max(m,p[x]); x=p[x]; } ans+=2*(m-i); if(m!=i) { if(end<i)step+=(i-end); if(end<m)end=m; } } } ans+=2*step; 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...