제출 #708113

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

using i64 = long long;

void chmax(i64 &a, i64 b) {
    if (a < b) a = b;
}

long long minimum_walk(std::vector<int> p, int s) {
    const int n = (int)p.size();
    std::vector<i64> imos(n);
    for (int i = 0; i < n; ++i) {
        int a = i, b = p[i];
        if (a > b) std::swap(a, b);
        ++imos[a];
        --imos[b];
    }
    for (int i = 0; i < n - 1; ++i) imos[i + 1] += imos[i];
    i64 baseCost = std::accumulate(imos.begin(), imos.end(), 0ll);
    i64 x = 0;
    for (int i = 1; i < n; ++i) {
        if (imos[i - 1] == 0 and imos[i] != 0) {
            chmax(x, i);
        }
    }
    return baseCost + 2 * x;
}
#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...