제출 #1080152

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1080152		TB_	Ancient Books (IOI17_books)	C++17	0 / 100	1 ms	348 KiB

books

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define fo(i, n) for(ll i = 0; i<(n); i++)
#define F first
#define S second
#define pb push_back

typedef vector<ll> vl;
typedef vector<vl> vvl;

vl color, nextB;
ll ans = 0, c = 0;

void dfs(int u){
    if(color[u]!=-1) return;
    color[u] = c;
    dfs(nextB[u]);
    ans+=abs(nextB[u]-u);
}

long long minimum_walk(std::vector<int> p, int s){
    ll n = p.size();
    fo(i, n)nextB.pb(p[i]);
    color.assign(n, -1);
    fo(i, n){
        if(color[i]!=-1) continue;
        dfs(i);
        c++;
    }
    // priority_queue<tuple<ll, ll, ll>> pq;
    // fo(i, n){
    //     fo(j, n){

    //     }
    // }

	return ans+c*2;
}

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