Submission #1204864

#	Time	Username	Problem	Language	Result	Execution time	Memory
1204864		Captain_Georgia	Ancient Books (IOI17_books)	C++20	0 / 100	0 ms	328 KiB

books

#include "books.h"

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

typedef long long ll;

long long minimum_walk (vector<int> p, int s) {
	int cnt = 0, N = p.size();
	vector<int> used(N, 0);
	long long res = 0;
	for (int i = 0;i < N;i ++) {
		if (used[i] == 0) {
			if (cnt <= 0 && i > 0) res += 2;
			if (p[i] != i) cnt --;
			int node = i;
			while (p[node] != i) {
				used[node] = 1;
				cnt ++;
				res += abs(node - p[node]);
				node = p[node];
			}
			res += abs(node - p[node]);
			used[node] = 1;
		} else {
			cnt --;
		}
	}
	return res;
}

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