Submission #290412

#TimeUsernameProblemLanguageResultExecution timeMemory
290412A02Ancient Books (IOI17_books)C++14
0 / 100
1 ms256 KiB
#include <bits/stdc++.h>
#include "books.h"

using namespace std;

long long minimum_walk(vector<int> p, int s) {

	long long book_total = 0;

	int n = p.size();

	for (int i = 0; i < n; i++){
        book_total += max(p[i] - i, i - p[i]);
	}

	if (s == 0){
        int current_region_max = 0;
        for (int i = 0; i < n; i++){
            if (current_region_max < i){
                book_total += 2;
            }
            current_region_max = max(current_region_max, i);
            current_region_max = max(current_region_max, p[i]);
        }
	}

	return book_total;

}
#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...