Submission #761387

#	Time	Username	Problem	Language	Result	Execution time	Memory
761387		Rafi22	Ancient Books (IOI17_books)	C++14	0 / 100	0 ms	212 KiB

books

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

const int N=1000007;

bool odw[N];

ll minimum_walk(vector<int>p,int s)
{
    int n=sz(p);
    ll ans=0;
    for(int i=0;i<n;i++) ans+=abs(p[i]-i);
    int c=0,mx=0;
    for(int i=0;i<n;i++)
    {
        mx=max(mx,p[i]);
        if(i!=n-1&&mx==i) ans+=2;
        if(odw[i]) continue;
        int x=i;
        while(!odw[x])
        {
            c++;
            odw[x]=1;
            x=p[x];
        }
        if(c==n) break;
    }
    return ans;
}
/*
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout<<minimum_walk({3, 2, 1, 0}, 0);


    return 0;
}*/

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