Submission #877321

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

books

#include "books.h"
#include <bits/stdc++.h>

using namespace std;

long long minimum_walk(vector<int> p, int s) {
  int n = (int) p.size();
  vector<int> all;
  long long cost = 0;
  vector<bool> was(n);
  for (int i = 0; i < n; i++) {
    if (was[i]) {
      continue;
    }
    int x = i;
    vector<int> vec;
    while (!was[x]) {
      was[x] = true;
      vec.push_back(x);
      cost += abs(p[x] - x);
      x = p[x];
    }
    sort(vec.begin(), vec.end());
    if (vec.size() > 1) {
      all.push_back(vec[0]);
    }
  }
  if (!all.empty()) {
    cost += *max_element(all.begin(), all.end()) * 2;
  }
  return cost;
}

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