제출 #1212673

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1212673		lrnnz	Ancient Books (IOI17_books)	C++20	50 / 100	98 ms	29668 KiB

books

#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include "books.h"
using namespace std;
 
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define ll long long
#define ld long double
#define ui uint64_t
#define cont(set, element) ((set).find(element) != (set).end())
 
/********* DEBUG *********/
 
template <typename T>
void outvec(const vector<T>& Z){
    for (const T& x : Z)
    cout << x << ' ';
    cout << "\n";
}
void printVariable(const any& var) {
    if (!var.has_value()) {
        cout << "null";
        return;
    }

    if (var.type() == typeid(int)) {
        cout << any_cast<int>(var);
    } else if (var.type() == typeid(double)) {
        cout << any_cast<double>(var);
    } else if (var.type() == typeid(float)) {
        cout << any_cast<float>(var);
    } else if (var.type() == typeid(char)) {
        cout << any_cast<char>(var);
    } else if (var.type() == typeid(bool)) {
        cout << (any_cast<bool>(var) ? "true" : "false");
    } else if (var.type() == typeid(string)) {
        cout << any_cast<string>(var);
    } else if (var.type() == typeid(const char*)) {
        cout << any_cast<const char*>(var);
    } else if (var.type() == typeid(long long)) {
        cout << any_cast<long long>(var);
    } else {
        cout << "[unknown type]";
    }
}

template<typename... Args>
void outval(Args... args) {
    vector<any> variables = {args...};
    
    for (size_t i = 0; i < variables.size(); ++i) {
        printVariable(variables[i]);
        if (i != variables.size() - 1) {
            cout << " ";
        }
    }
    cout << "\n";
}

#define sp << " " <<

/********* DEBUG *********/

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll inf = 1e18;
const ll mxN = 1000005;

bool cmp(vector<ll> &a, vector<ll> &b){
    return a[0] < b[0];
}

ll minimum_walk(vector<int> p, int s) {
    ll n = p.size();

    vector<ll> vis(n);
    vector<vector<ll>> cycles;
    for (int i = 0; i < n; i++){
        if (p[i] != i && !vis[i]){
            ll r = i, moves = 0;
            ll curr = p[i];
            
            moves += abs(curr-i);
            vis[i] = true;

            while (curr != i){
                vis[curr] = true;
                moves+=abs(curr-p[curr]);

                r = max(r, (ll)curr);
                curr = p[curr];
            }

            cycles.push_back({i, r, moves});
        }
    }

    sort(all(cycles), cmp);

    ll ans = 0, hiR = 0, add = 0;
    for (int i = 0; i < cycles.size(); i++){
        ans += cycles[i][2];
        add += max(0LL, cycles[i][0] - hiR);
        hiR = max(hiR, cycles[i][1]);
    }

    return ans + add * 2;
}

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