| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 70452 | bnahmad15 | Ancient Books (IOI17_books) | C++17 | 281 ms | 30296 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1000001;
 
int n;
bool vis[N];
vector<pair<vector<int>,long long> > v;
priority_queue <int> points;
long long minimum_walk(std::vector<int> p, int s) {
	n = p.size();
	for(int i = 0;i<n;i++)
		vis[i] = 0;
	v.clear();
	for(int i = 0;i<n;i++){
		if(p[i] != i && vis[i] == false){
			v.push_back(make_pair(vector<int>(),0));
			v.back().first.push_back(i);
			vis[i] = true;
			v.back().second += 1LL * abs(p[i] - i);
			int j = p[i];
			while (j != i){
				vis[j] = true;
				v.back().first.push_back(j);
				v.back().second += 1LL * abs(p[j] - j);
				j = p[j];
			}
		}
	}
	long long res = 0;
	if(v.size()){
		points.push(0);
		for(int i = 0;i<v.size();i++){
			res += 1LL * v[i].second;
			if(v[i].first[0] > points.top())
				res += 2LL * abs(v[i].first[0] - points.top());	
			for(int j = 0;j<v[i].first.size();j++)
				points.push(v[i].first[j]);
		}
	}
	return res;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
