제출 #977357

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

books

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

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

ll minimum_walk(vector<int> p, int s) {
	int n = sz(p);
	vector<bool> vis(n);
	vector<pii> range;

	ll ans = 0;
	for(int i = 0; i < n; i++) {
		int x = i, m = i;
		while(!vis[x]) {
			vis[x] = 1;
			x = p[x];
			m = max(m, x);
		}

		ans += abs(p[i]-i);
		if(i != m) range.pb({i,m});
	}

	int L = 0;
	for(int i = 0; i < sz(range);) {
		int l = range[i].fr, r = range[i].sc, j = i;
		while(j < sz(range) and range[j].fr < r) {
			r = max(r, range[j].sc);
			j++;
		}
		i=j;
		L = l;
	}

	return ans + 2*L;
}

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