제출 #371103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
371103		doowey	고대 책들 (IOI17_books)	C++14	50 / 100	218 ms	26864 KiB

books

#include <bits/stdc++.h>
#include "books.h"

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair

int n;
const int N = (int)1e6 + 100;
int lef[N], rig[N];
bool vis[N];
bool has[N];

int tl, tr;


void extend(int &li, int &ri){
    int ni = min(lef[li],lef[ri]);
    int nj = max(rig[li],rig[ri]);
    while(li > ni || ri < nj){
        if(li > ni){
            li--;
            ni = min(ni, lef[li]);
            nj = max(nj, rig[li]);
        }
        else{
            ri++;
            ni = min(ni, lef[ri]);
            nj = max(nj, rig[ri]);
        }
    }
}

int disl[N];
int disr[N];


int solve(int li, int ri){
    int cnt = 0;
    extend(li, ri);
    while(li != tl || ri != tr){
        if(disl[li] < disr[ri] && li > tl){
            li -- ;
            cnt += 2;
        }
        else{
            ri ++ ;
            cnt += 2;
        }
        extend(li,ri);
    }
    return cnt;
}
long long minimum_walk(vector<int> p, int s) {
	n = p.size();
	int id;
	int low, high;
	ll sol = 0;
    tl = tr = s;
	for(int i = 0 ; i < n; i ++ ){
        sol += abs(p[i] - i);
        if(!vis[i]){
            vector<int> cyc;
            id = i;
            while(!vis[id]){
                vis[id]=true;
                cyc.push_back(id);
                id=p[id];
            }
            low = n-1;
            high = 0;
            for(auto x : cyc){
                low = min(low, x);
                high = max(high, x);
            }
            for(auto x : cyc){
                lef[x] = low;
                rig[x] = high;
            }
        }
        if(p[i] != i){
            tl = min(tl, i);
            tr = max(tr, i);
        }
	}
    for(int i = 0 ; i < n; i ++ ){
        disl[i] = (int)1e9;
        if(rig[i] >= s)
            disl[i]=0;
        if(lef[i] < i){
            disl[i] = min(disl[i], disl[i - 1]);
        }
        if(lef[i] > 0)
            disl[i] = min(disl[i], disl[lef[i] - 1] + 2);
    }
    for(int i = n - 1; i >= 0 ; i -- ){
        disr[i]=(int)1e9;
        if(lef[i] <= s)
            disr[i]=0;
        if(rig[i] > i)
            disr[i]=min(disr[i],disr[i+1]);
        if(rig[i] + 1 < n)
            disr[i] = min(disr[i], disr[rig[i] + 1] + 2);
    }
	return sol + solve(s, s);
}

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