제출 #1052426

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

books

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

using namespace std;

#define rall(s) s.rbegin(), s.rend()
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()
#define s second
#define f first

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int N = 3e5;

ll minimum_walk(vector<int> p, int s) {
	int n = sz(p), mx = 0;
	vector<int> was(n + 1);
	ll ans = 0;
	for (int i = 0; i < n; i++) {
		if (was[i] || i == p[i]) continue;
		int x = i, mn = n;
		while (!was[x]) {
			mn = min(mn, x);
			was[x] = 1;
			ans += abs(p[x] - x);
			x = p[x];
		}
		mx = max(mx, mn);
	}
	ans += (mx - s) * 2;
	return ans;
}

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