Submission #1080258

#	Time	Username	Problem	Language	Result	Execution time	Memory
1080258		TB_	Ancient Books (IOI17_books)	C++17	12 / 100	1 ms	436 KiB

books

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fo(i, n) for(ll i = 0; i<(n); i++)
#define F first
#define S second
#define pb push_back
#define deb(x) cout << #x << " = " << (x) << endl
#define deb2(x, y) cout << #x << " = " << (x) << ", " << #y << " = " << (y) << endl

typedef vector<ll> vl;
typedef vector<vl> vvl;


vl color, nextB, highest;
ll ans = 0, c = 0;

void dfs(int u){
    if(color[u]!=-1) return;
    highest[c]=max(highest[c], (ll)u);
    color[u] = c;
    dfs(nextB[u]);
    ans+=abs(nextB[u]-u);
}

long long minimum_walk(std::vector<int> p, int s){
    ll n = p.size();
    fo(i, n)nextB.pb(p[i]);
    color.assign(n, -1);
    ll biggest = 0;
    fo(i, n){
        if((nextB[i] == i && i)|| color[i]!=-1) continue;
        biggest = i+1;
        highest.pb(-1);
        dfs(i);
        c++;
    }
    ll current = 0;
    fo(i, biggest){
        if(current<i)ans+=2;
        current = max(current, highest[color[i]]);
    }

	return ans;
}

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