Submission #915150

#	Time	Username	Problem	Language	Result	Execution time	Memory
915150		nightfal	Ancient Books (IOI17_books)	C++14	50 / 100	91 ms	12116 KiB

books

#include <cstdio>
#include <vector>
#include <cassert>
#include <cstdlib>

using namespace std;

bool isSubtask3(int s) {return s==0;}

long long subtask3(vector<int> p, int s, int dir = 1) {
    int n = p.size(), last = s;
    long long total = 0;

    for(int i=s; 0<=i && i<n; i += dir) {
        if (i==p[i]) continue;
        if (dir*(i-last) > 0) total += abs(i-last)*2;
        total += abs(p[i]-i);
        last = dir==1? max(last,p[i]):min(last,p[i]);
    }
	return total;
}

long long minimum_walk(std::vector<int> p, int s) {
	return subtask3(p,0);
}

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