제출 #959757

#제출 시각아이디문제언어결과실행 시간메모리
95975712345678고대 책들 (IOI17_books)C++17
50 / 100
86 ms19444 KiB
#include "books.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long

const int nx=1e6+5;

int vs[nx], n, lst, dp[nx];
ll res;

long long minimum_walk(std::vector<int> p, int s) {
    n=p.size();
    for (int i=0; i<n; i++)
    {
        res+=abs(i-p[i]);
        dp[min(i, p[i])]++;
        dp[max(i, p[i])]--;
    }
    for (int i=1; i<n; i++) dp[i]+=dp[i-1];
    for (int i=n-1; i>=0; i--)
    {
        if (dp[i]) break;
        dp[i]=1;
    }
    for (int i=0; i<n-1; i++) if (dp[i]==0) res+=2;
	return res;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...