oj.uz

답안 #998565

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998565 2024-06-14T08:25:47 Z bachhoangxuan 고대 책들 (IOI17_books) C++17
0 / 100
 0 ms 348 KB 
#include "books.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e6+5;
int f[maxn],lt[maxn],rt[maxn],L,R;

void g(int &l,int &r){
    int cl=min(lt[f[r]],lt[f[l]]),cr=max(rt[f[r]],rt[f[l]]);
    while(l>cl || r<cr){
        if(l>cl){
            cl=min(cl,lt[f[--l]]);
            cr=max(cr,rt[f[l]]);
        }
        else{
            cl=min(cl,lt[f[++r]]);
            cr=max(cr,rt[f[r]]);
        }
    }
}

long long minimum_walk(std::vector<int> p, int s) {
    long long ans=0;
    int n=(int)p.size(),cnt=0;
    L=s,R=s;
    for(int i=0;i<n;i++){
        if(!f[i]){
            cnt++;
            int u=i,mn=i,mx=i;
            while(!f[u]){
                f[u]=cnt;
                mn=min(mn,u);
                mx=max(mx,u);
                u=p[u];
            }
            lt[cnt]=mn;
            rt[cnt]=mx;
            if(p[i]!=i) L=min(L,mn),R=max(R,mx);
        }
        ans+=abs(i-p[i]);
    }
    int l=s,r=s;
    while(true){
        int al=l,ar=r,bl=l,br=r,ac=0,bc=0;
        while(al>L && ar==r) g(--al,ar),ac+=2;
        while(br<R && bl==l) g(bl,++br),bc+=2;
        if(ar==r){ans+=ac+bc;break;}
        ans+=min(ac,bc);l=al,r=ar;
    }
    return ans;
}

Subtask #1
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
4 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
4 Halted 0 ms 0 KB -

Subtask #3
0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '3304', found: '3306'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '8', found: '10'
4 Halted 0 ms 0 KB -