제출 #423968

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
423968		2fat2code	고대 책들 (IOI17_books)	C++17	22 / 100	134 ms	16284 KiB

books

#include "books.h"
#include<bits/stdc++.h>
#define fr first
#define sc second
#define all(s) s.begin(), s.end()
using namespace std;

const int nmax = 1005;

long long n, comp, viz[nmax], l_ned, r_ned, ans;
pair<long long,long long>extend[nmax];
vector<long long>cicles[nmax];
pair<long long, long long>dp[nmax][nmax];

long long compute(long long L, long long R){
    if(L <= l_ned && R >= r_ned) return 0LL;
    else{
        if(dp[L][R].sc == 1){
            return dp[L][R].fr;
        }
        else{
            dp[L][R].sc = 1;
            dp[L][R].fr = 1e18;
            if(L > 0){
                dp[L][R].fr = compute(min(L-1, extend[viz[L-1]].fr), max(R, extend[viz[L-1]].sc)) + 2LL;
            }
            else if(R < n-1){
                dp[L][R].fr = min(dp[L][R].fr, compute(min(L, extend[viz[R+1]].fr), max(R+1, extend[viz[R+1]].sc)) + 2LL);
            }
            return dp[L][R].fr;
        }
    }
}

vector<long long>nod[nmax];
bitset<nmax>vis;

void dfs1(long long s, long long val){
    vis[s] = 1;
    extend[s].fr = min(extend[s].fr, val);
    for(auto it : nod[s]){
        if(!vis[it]) dfs1(it, val);
    }
}

void dfs2(long long s, long long val){
    vis[s] = 1;
    extend[s].sc = max(extend[s].fr, val);
    for(auto it : nod[s]){
        if(!vis[it]) dfs2(it, val);
    }
}

long long minimum_walk(vector<int> p, int s) {
	n = (int)p.size();
	for(int i=0;i<n;i++){
        ans += abs(i - p[i]);
	}
	for(int i=0;i<n;i++){
        if(!viz[i]){
            ++comp;
            viz[i] = comp;
            cicles[comp].push_back(i);
            int curr = p[i];
            while(curr  !=  i){
                viz[curr] = comp;
                cicles[comp].push_back(curr);
                curr = p[curr];
            }
        }
	}
	for(int i=1;i<=comp;i++){
        sort(all(cicles[i]));
	}
	for(int i=1;i<=comp;i++){
        extend[i].fr = cicles[i][0];
        extend[i].sc = cicles[i].back();
	}
    for(int i=0;i<=n-1;i++){
        for(int j=1;j<=comp;j++){
            if(i != j){
                if(cicles[j][0] <= i && cicles[j].back() >= i){
                    nod[viz[i]].push_back(j);
                    nod[j].push_back(viz[i]);
                }
            }
        }
    }
    vector<pair<long long,long long>>vecc;
    for(int i=1;i<=comp;i++){
        vecc.push_back({cicles[i][0], i});
    }
    sort(all(vecc));
    for(auto it : vecc){
        if(!vis[it.sc]) dfs1(it.sc, it.fr);
    }
    vis.reset();
    vecc.clear();
    for(int i=1;i<=comp;i++){
        vecc.push_back({cicles[i].back(), i});
    }
    sort(all(vecc));
    reverse(all(vecc));
    for(auto it : vecc){
        if(!vis[it.sc]) dfs2(it.sc, it.fr);
    }
	while(p[l_ned] == l_ned && s > l_ned) l_ned++;
	r_ned = n - 1;
	while(p[r_ned] == r_ned && s < r_ned) r_ned--;
	return compute(extend[viz[s]].fr, extend[viz[s]].sc) + ans;
}

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