Submission #821250

#	Time	Username	Problem	Language	Result	Execution time	Memory
821250		vjudge1	Ancient Books (IOI17_books)	C++17	0 / 100	2059 ms	212 KiB

books

#include "books.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

long long minimum_walk(vector<int> p, int s) {
    int c = 0, n = p.size();
    for(; n && p[n - 1] == n - 1; -- n);
    for(int cr = 0, take = -1; n;) {
        if(cr == p[cr]) {
            cr += (take == -1 || take > cr ? +1 : -1);
            continue;
        }
        if(take == cr) {
            swap(take, p[cr]);
            if(cr == n - 1) {
                -- n;
            }
        } else if(take == -1) {
            take = p[cr];
            p[cr] = 0;
        } else if(take < p[cr]){
            swap(take, p[cr]);
        }
    }
    return c;
}

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