Submission #577477

#	Time	Username	Problem	Language	Result	Execution time	Memory
577477		definitelynotmee	Ancient Books (IOI17_books)	C++98	0 / 100	1 ms	276 KiB

books

#include<bits/stdc++.h>
#include "books.h"
using namespace std;
#define ff first
#define ss second
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
template<typename T>
using matrix = vector<vector<T>>;

long long minimum_walk(std::vector<int> p, int s) {
	int mindif = -1;
    int n = p.size();
    vector<int> check(n);
    auto dfs =[&](int id,auto dfs)->int{
        check[id] = 1;
        if(check[p[id]])
            return 0;
        return dfs(p[id],dfs)+1;
    };
    for(int i = 0; i < n ; i++){
        if(!check[i]){
            int cur = dfs(i,dfs);
            if(cur != 0)
                mindif = i;
        }
    }
    
    ll resp = 2*mindif;
    for(int i = 0; i < n; i++){
        resp+=abs(i-p[i]);
    }
    return resp;
}

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