Submission #124689

#	Time	Username	Problem	Language	Result	Execution time	Memory
124689		Sorting	Ancient Books (IOI17_books)	C++14	0 / 100	2 ms	380 KiB

books

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6 + 7;

bool used[N];

long long minimum_walk(vector<int> p, int s){
	int n = (int)p.size();

	for(int i = 0; i < n; i++){
		used[i] = false;
	}

	int curr = 0, cnt = n;
	long long ans = 0;

	while(cnt){
		if(p[curr] == curr || used[curr]){
			curr++;
			ans += 1;
			continue;
		}

		used[p[curr]] = true;

		cnt--;
		if(!cnt){
			ans += p[curr];
		}

		ans += abs(p[curr] - curr);

		curr = p[curr];
	}

	return ans;
}

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