제출 #293001

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
293001		Haunted_Cpp	Ancient Books (IOI17_books)	C++17	0 / 100	1 ms	512 KiB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;


const int MAX_N = 1e6 + 5;
vector<int> p;

long long solve(int idx, int carry) {
  int current_location = idx;
  int nxt_location = carry;
  if (current_location != nxt_location) {
    return abs(idx - nxt_location) + solve(nxt_location, carry);
  }
  assert(idx != -1);
  int was = p[current_location];
  p[current_location] = carry;
  assert(was != carry);
  carry = was;

  nxt_location = carry;
  if (carry == -1) return current_location;
  return abs(idx - nxt_location) + solve(nxt_location, carry);
}

long long minimum_walk(vector<int> p, int s) {
  assert(s == 0);
  ::p = p;
  const int n = p.size();
  for (int i = 0; i < n; i++) {
    if (p[i] != i) {
      int was = p[i];
      ::p[i] = -1;
      return i + solve(i, was);
    }
  }
  return -1;
}

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