제출 #806871

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

books

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

using ll = long long;

#define N 1100000

int n, type[N];

ll minimum_walk(vector<int> p, int s) {
	n = p.size();
	ll ans = 0;
	for (int i = 0; i < n; i++)
		ans += abs(i - p[i]);
	fill(type, type + n, -1);
	int cycles = 0;
	for (int i = 0; i < n; i++) {
		if (type[i] != -1 || i == p[i]) continue;
		int cur = i;
		do {
			type[cur] = cycles;
			cur = p[cur];
		} while (cur != i);
		cycles++;
	}
	if (cycles == 0) return 0;
	int closest = n;
	for (int i = 0; i < n; i++)
		if (type[i] != -1) closest = min(closest, abs(i - s));
	return ans + 2 * (cycles - 1 + closest);
}

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