Submission #1025466

#	Time	Username	Problem	Language	Result	Execution time	Memory
1025466		huutuan	Ancient Books (IOI17_books)	C++14	0 / 100	0 ms	348 KiB

books

#include "books.h"

#include <bits/stdc++.h>

using namespace std;

const int N=1e6;
int vis[N], n;

long long minimum_walk(vector<int> p, int s) {
   n=p.size();
   vector<int> v;
   long long ans=0;
   int mx=0;
   for (int i=0; i<n; ++i) if (!vis[i]){
      mx=max(mx, i);
      while (!vis[i]){
         vis[i]=1;
         ans+=abs(p[i]-i);
         i=p[i];
      }
   }
   return ans+mx*2;
}

• Subtask 1: 0 / 12
• Subtask 2: 0 / 10
• Subtask 3: 0 / 28
• Subtask 4: 0 / 20
• Subtask 5: 0 / 30