Submission #156409

#	Time	Username	Problem	Language	Result	Execution time	Memory
156409		dolphingarlic	Ancient Books (IOI17_books)	C++14	0 / 100	2 ms	376 KiB

books

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

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

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

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