Submission #1158624

#TimeUsernameProblemLanguageResultExecution timeMemory
1158624Sharky고대 책들 (IOI17_books)C++20
12 / 100
0 ms328 KiB
#include "books.h"
#include <bits/stdc++.h>
using namespace std;

long long minimum_walk(std::vector<int> p, int s) {
	int f = 0, n = p.size();
	while (n >= 1 && p[n-1] == n-1) n--;
	for (int i = 0; i < n; i++) {
		if (p[i] == i) f++;
		else break;
	}
	long long ans = 0;
	for (int i = 0; i < n; i++) ans += abs(p[i] - i);
	return ans + f * 2;
}
#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...