Submission #914065

#	Time	Username	Problem	Language	Result	Execution time	Memory
914065		nightfal	Ancient Books (IOI17_books)	C++14	50 / 100	129 ms	18784 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 n = p.size(), last = 0;
    long long total = 0;

    for(int i=0; i<n; i++) {
        if (i==p[i]) continue;
        if(i>last) total += (i-last)*2;
        total += abs(p[i]-i);

        last = max(last,i);
        int idx = p[i]; p[i] = i;
        while(idx!=i) {
            last = max(last,idx);
            total += abs(p[idx]-idx); 
            int prevIdx = idx; 
            idx = p[idx];
            p[prevIdx] = prevIdx;
        }
    }
	return total;
}

long long fulltask(vector<int> p, int s) {
    return 0;
}

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

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