제출 #1061729

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

using namespace std;
typedef long long ll;
const int N = 1e6 + 12;
int n;
int c[N];
bool isl[N],isr[N];
long long minimum_walk(vector<int> p, int s) {
    n = (int)p.size();
    int it = 0;
    ll res = 0;
    for(int i = 0;i < n;i++) {
        res += abs(i - p[i]);
    }
    for(int i = 0;i < n;i++) {
        if(c[i]) continue;
        it++;
        vector<int> v;
        int x = i;
        while(c[x] != it) {
            c[x] = it;
            x = p[x];
            v.push_back(x);
        }
        sort(v.begin(),v.end());
        isl[v[0]] = isr[v.back()] = 1;
    }
    for(int i = 0;i < n - 1;i++) {
        if(c[i] != c[i - 1] && isr[i] && isl[i + 1]) {
            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...