Submission #73399

#	Time	Username	Problem	Language	Result	Execution time	Memory
73399		Navick	Ancient Books (IOI17_books)	C++17	0 / 100	3 ms	548 KiB

books

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

#define F first
#define S second
#define pii pair<int, int>
#define pb push_back

using namespace std;

typedef long long ll;

const int maxN = 1e6 + 10;

bool mark[maxN];

long long minimum_walk(std::vector<int> p, int s) {
	int n = p.size(), m = 0;
	ll ans = 0;

	for (int i=0; i<n; i++)
	{
		if(mark[i]) continue ;
		int curr = i, mn = n, sz = 0;
		while(!mark[curr])
		{
			sz ++;
			mn = min(mn, curr);
			mark[curr] = true;
			ans += abs(p[curr] - curr);
			curr = p[curr];
		}
		if(sz >= 2) m = max(m, mn);
	}
	return ans + 2LL * m;
}

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