Submission #240042

#TimeUsernameProblemLanguageResultExecution timeMemory
240042JatanaAncient Books (IOI17_books)C++17
0 / 100
1602 ms1048576 KiB
#include "books.h"
#include <vector>
#include <algorithm>
#include <iostream>

#define pb push_back
#define le(v) ((int)v.size())

using namespace std;
typedef long long ll;

ll minimum_walk(vector<int> p, int s) {
	ll rez = 0;
	while (!is_sorted(p.begin(), p.end())) {
		if (p[s] == s) {
			s++; rez++;
		} else {
			int t = p[s];
			vector<int> ind{s};
			while (t != s) {
				ind.pb(t);
				t = p[t];
			}
			// for (int x : ind) {
			// 	cout << x << " ";
			// }
			// cout << endl;
			for (int i = 0; i < le(ind); i++) {
				int j = (i + 1) % le(ind);
				rez += abs(ind[i] - ind[j]);
			}
			sort(ind.begin(), ind.end());
			for (int x : ind) {
				p[x] = x;
			}	
		}
	}
	rez += s;
	return rez;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...