Submission #619611

#	Time	Username	Problem	Language	Result	Execution time	Memory
619611		Sergio_2357	Ancient Books (IOI17_books)	C++17	0 / 100	2087 ms	272 KiB

books

#include "books.h"
#include <bits/stdc++.h>
using namespace std;

typedef vector<int> vi;

int n;
int l = 0;
int h = -1;
vi a;

int bst = INT_MAX;

bool correct()
{
    bool r = true;
    for (int i = 0; i < n; i++)
        if (a[i] != i)
            r = false;
    return r;
}

void bk(int p, int d)
{
    //cout << d << endl;
    if (p == 0 && correct()) {
        bst = min(bst, l);
        return;
    }
    if (l >= bst || d >= 15)
        return;
    for (int i = 0; i < n; i++) {
        if (i == p)
            continue;
        l += abs(p - i);
        swap(h, a[p]);
        bk(i, d + 1);
        swap(h, a[p]);
        bk(i, d + 1);
        l -= abs(p - i);
    }
}

long long minimum_walk(vector<int> p, int s)
{
    //cout << "HELLO" << endl;
    n = p.size();
    for (int x : p)
        a.push_back(x);
    bk(0, 0);
    return bst;
}

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