Submission #1047197

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047197		Ahmed57	Ancient Books (IOI17_books)	C++17	0 / 100	1 ms	348 KiB

books

#include "bits/stdc++.h"
using namespace std;
vector<int> P;
int vis[1001];
int sz = 0;
void dfs(int i){
    vis[i] = 1;
    sz++;
    if(!vis[P[i]])dfs(P[i]);
}
long long minimum_walk(vector<int> p, int s){
    int ans = 0;
    int n = p.size();
    P.clear();
    for(int i = 0;i<n;i++){
        vis[i] = 0;
        P.push_back(p[i]);
        ans+=abs(i-p[i]);
    }
    vector<int> lol;
    for(int i = 0;i<n;i++){
        if(!vis[i]){
            sz = 0;
            dfs(i);
            if(i==0||sz>1)lol.push_back(i);
        }
    }
    int sz = lol.size();
    ans+=(sz-1)*2;
    return ans;
}

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