제출 #1199423

#제출 시각아이디문제언어결과실행 시간메모리
1199423Hanksburger고대 책들 (IOI17_books)C++17
0 / 100
0 ms328 KiB
#include "books.h"
#include <bits/stdc++.h>
using namespace std;
long long minimum_walk(vector<int> a, int s)
{
    long long ans=0;
    vector<int> v(a.size(), 0);
    for (int i=0; i<a.size(); i++)
    {
        ans+=abs(i-a[i]);
        if (v[i])
            continue;
        int cur=i;
        while (!v[cur])
        {
            v[cur]=1;
            cur=a[cur];
        }
        ans++;
    }
    return ans;
}
#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...