Submission #566549

#	Time	Username	Problem	Language	Result	Execution time	Memory
566549		Siffer	Ancient Books (IOI17_books)	C++14	0 / 100	1 ms	212 KiB

books

#include "books.h"
#include<bits/stdc++.h>
using namespace std;

#define ll long long


ll minimum_walk(vector<int> p, int s) {
	int n = p.size();
	vector<int> c(n,-1);
	int r = 0;
	vector<int> mi(n,n), ma(n,0);
	for(int i = 0; i < n; i++) {
		if(c[i] == -1) {
			c[i] = i;
			int k = p[i];
			r += abs(i-k);
			mi[i] = i;
			ma[i] = i;
			while(k != i) {
				mi[i] = min(mi[i], k);
				ma[i] = max(ma[i], k);
				c[k] = i;
				r += abs(k-p[k]);
				k = p[k];
			}
		}
	}
	int m = 0;
	while(m < n) {
		bool cc = 1;
		for(int i = m; i < m+1; i++) {
			if(ma[c[i]] > m) {
				cc = 0;
				m = ma[c[i]];
			}
		}
		if(cc && m < n) {
			m++;
			r += 2;
		}
	}
	return r-2;
}

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