Submission #1208197

#	Time	Username	Problem	Language	Result	Execution time	Memory
1208197		jasonic	Ancient Books (IOI17_books)	C++20	12 / 100	0 ms	328 KiB

books

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

#define ll long long
#define fastIO cin.tie(0); ios::sync_with_stdio(false)
#define cerr if(0) cout

int n;

ll minimum_walk(vector<int> p, int s) {
    n = size(p);
    vector<bool> vis(n, false);
    assert(s == 0);
    ll maxL = 0;
    ll ans = 0;

    for(ll l = 0, i = 0, r = 0, size = 0; r < n; i++) {
        if(p[i] != i && !vis[i]) {
            vis[i] = true;
            ll prev = i;
            ll curr = p[i];
            while(curr != i) {
                cerr << prev << ' ' << curr << ' ' << abs(prev - curr) << '\n';
                vis[curr] = true;
                size += abs(prev - curr);
                r = max(curr, r);
                
                prev = curr;
                curr = p[curr];
            }
            cerr << prev << ' ' << curr << ' ' << abs(prev - curr) << '\n';
            size += abs(prev - curr);
        }
        if(i == r) {
            cerr << l << ' ' << r << '\n';
            cerr << size << '\n';
            
            if(l != r) {
                ans += size;
                maxL = l;
            }
            
            l = i+1;
            r = i+1;
            size = 0;
        }
    }
    cerr << maxL << '\n';
    return ans + maxL + maxL;
}

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