Submission #42953

#TimeUsernameProblemLanguageResultExecution timeMemory
42953MatheusLealVAncient Books (IOI17_books)C++14
0 / 100
2 ms580 KiB
#include <bits/stdc++.h>
#define N 501
using namespace std;
typedef long long ll;

int n, s, ans[1000050];

ll minimum_walk(vector<int> v, int s_)
{
    ll sum = 0, last = 0;

    n = v.size(), s = s_;

    for(int i = 0; i < n; i++)
    {
        while(v[i] != i)
        {
            swap(v[i], v[v[i]]);

            sum += abs(v[v[i]] - v[i]);

            last = min(v[i], v[v[i]]);
        }

        sum ++;
    }

    return sum + last - 1;
}
#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...