Submission #155854

#	Time	Username	Problem	Language	Result	Execution time	Memory
155854		dolphingarlic	Ancient Books (IOI17_books)	C++14	50 / 100	164 ms	9484 KiB

books

#include "books.h"
#include <math.h>
#include <algorithm>

long long minimum_walk(std::vector<int> p, int s) {
    int greatest = 0, n = p.size();

    int l = s, r = s;
    for (int i = s; i < n; i++) if (p[i] < s) r = i, l = std::min(l, p[i]);

    long long dist = std::min(s - l, r - s), ans = 0;
    for (int i = 0; i < n; i++) {
        if (p[i] != i) {
            ans += abs(p[i] - i);
            if (i > greatest) dist += i - greatest;
            greatest = std::max(greatest, p[i]);
        }
    }
    return ans + 2 * dist;
}

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