Submission #424783

#	Time	Username	Problem	Language	Result	Execution time	Memory
424783		saleh	Ancient Books (IOI17_books)	C++17	0 / 100	1 ms	204 KiB

books

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

using namespace std;

const int MAXN = 1000 * 1000 + 23;


int mark[MAXN], cnt = 0, ans, jav;

long long minimum_walk(std::vector<int> p, int s) {
	if (s != 0) return 0;
	int n = p.size();
	for (int i = 0; i < n; i++) if (p[i] != i && mark[i] == 0) {
		int tmp = i, pre = i;
		mark[i] = ++cnt;
		while ((tmp = p[tmp]) != i) {
			mark[tmp] = cnt;
			jav += abs(pre - tmp);
			pre = tmp;
		}
		ans = max(ans, i);
	}
	return jav + ans * 2;
}

//int main() {}

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