제출 #877400

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
877400		MilosMilutinovic	Ancient Books (IOI17_books)	C++14	12 / 100	0 ms	600 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);
  vector<int> R(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]);
      R[vec[0]] = vec.back();
    }
  }
  int pos = 0;
  int to = -1;
  for (int i = 0; i < n; i++) {
    if (p[i] == i) {
      continue;
    }
    if (to < i) {
      pos = i;
    }
    to = max(to, R[i]);
  }
  cost += 2 * pos;
  return cost;
}

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