Submission #1062406

#	Time	Username	Problem	Language	Result	Execution time	Memory
1062406		Faisal_Saqib	Ancient Books (IOI17_books)	C++17	0 / 100	2049 ms	604 KiB

books

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

#define ll long long
#define vll vector<ll>
#define all(x) begin(x),end(x)
#define pb push_back
ll ans=1e9;
void recur(ll i,ll n,vector<ll> p,ll hand,ll dist=0)
{
    bool check=1;
    for(int j=0;j<n;j++)
        check&=(p[j]==j);
    if(check and dist<ans and i==0)
        ans=dist;
    if(dist>20 or dist>=ans)return;
    if(i<0 or n<=i)return;
    recur(i+1,n,p,hand,dist+1);
    recur(i-1,n,p,hand,dist+1);
    swap(p[i],hand);
    recur(i+1,n,p,hand,dist+1);
    recur(i-1,n,p,hand,dist+1);
}
long long minimum_walk(std::vector<int> p, int s)
{
    int n=p.size();
    // Solve for s==0
    ans=1e9;
    vll tp;
    for(auto j:p)tp.pb(j);
    recur(s,n,tp,-1);
    return ans;
}

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