Submission #992404

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

books

#include "books.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
int f[maxn],cnt,d[maxn],num;

long long minimum_walk(std::vector<int> p, int s) {
    long long ans=0;
    int n=(int)p.size();
    for(int i=0;i<n;i++){
        if(!f[i] && i!=p[i]){
            int u=i;cnt++;
            while(!f[u]) f[u]=cnt,u=p[u];
        }
        ans+=abs(i-p[i]);
    }
    int mn=n,r=0;
    for(int i=0;i<n;i++){
        r=max(r,i);
        while(r<n && num<cnt){
            if(f[r]){
                num-=!!d[f[r]];
                d[f[r]]++;
                num+=!!d[f[r]];
            }
            r++;
        }
        if(num==cnt) mn=min(mn,max(r-1,s)-min(i,s));
        if(f[i]){
            num-=!!d[f[i]];
            d[f[i]]--;
            num+=!!d[f[i]];
        }
    }
    return ans+2*mn;
}

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