Submission #1208182

#TimeUsernameProblemLanguageResultExecution timeMemory
1208182jasonicAncient Books (IOI17_books)C++20
0 / 100
0 ms324 KiB
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define fastIO cin.tie(0); ios::sync_with_stdio(false)
#define cerr if(1) 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; i < n; i++) {
        if(p[i] != i && !vis[i]) {
            vis[i] = true;
            ll prev = i;
            ll curr = p[i];
            while(curr != i) {
                vis[curr] = true;
                size += abs(prev - curr);
                r = max(curr, r);
                prev = curr;
                curr = p[curr];
            }
            size += abs(prev - curr);
        }
        if(i == r) {
            ans += size;
            maxL = l;
            l = r+1;
        }
    }
    return ans + maxL;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...