Submission #57799684

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/modint>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/integer/common_factor_ct.hpp>

namespace {
    using ModInt [[maybe_unused]] = atcoder::modint998244353;
    using Num [[maybe_unused]] = long long int;
    using Vec [[maybe_unused]] = std::vector<Num>;
    using Set [[maybe_unused]] = std::set<Num>;
    using Mset [[maybe_unused]] = std::multiset<Num>;
    using Edges [[maybe_unused]] = std::vector<std::vector<Num>>;
    using BigInt = boost::multiprecision::cpp_int;

    template<typename T>
    using Q [[maybe_unused]] = std::queue<T>;

    template<typename T>
    using PQ [[maybe_unused]] = std::priority_queue<T, std::vector<T>, std::greater<T>>;

    const std::vector<std::pair<Num, Num>> dyxs {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
    std::map<char, std::pair<Num, Num>> directions {{'D', {1, 0}}, {'U', {-1, 0}}, {'R', {0, 1}}, {'L', {0, -1}}};

    template<typename T>
    void print_oneline(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << (((i+1) == size) ? '\n' : ' ');
        }
    }

    template<typename T>
    void print_each(const std::vector<T>& vec, std::ostream& os) {
        const auto size = vec.size();
        for(size_t i{0}; i<size; ++i) {
            os << vec.at(i) << '\n';
        }
    }
}

void solve(std::istream& is, std::ostream& os) {
    Num n {0};
    is >> n;

    Vec ps(n);
    for(auto&& x : ps) {
        is >> x;
        --x;
    }

    Vec ns(n);
    for(auto&& x : ns) {
        is >> x;
        --x;
    }

    BigInt period = 1;
    BigInt rem = 0;
    auto result = ns;
    std::vector<bool> seen(n);

    for(Num i{0}; i<n; ++i) {
        if (seen.at(i)) {
            continue;
        }

        Vec cycle;
        const Num init = i;
        Num current = init;
        for(;;) {
            cycle.push_back(current);
            seen.at(current) = true;
            Num next = ps.at(current);
            if (next == init) {
                break;
            }
            current = next;
        }

        const Num size = static_cast<Num>(cycle.size());
        const BigInt n_choose = size / boost::math::gcd(size, period);

        Vec vs;
        for(Num j{0}; j<n_choose; ++j) {
            const Num p = static_cast<Num>((rem + j * period) % size);
            vs.push_back(ns.at(cycle.at(p)));
        }

        const auto offset = std::ranges::min_element(vs) - vs.begin();
        rem += offset * period;
        period *= n_choose;

        for(Num j{0}; j<size; ++j) {
            const Num p = static_cast<Num>((j + rem) % size);
            result[cycle.at(j)] = ns.at(cycle.at(p));
        }
    }

    for(Num i{0}; i<n; ++i) {
        os << result.at(i) + 1 << (((i+1)==n) ? '\n' : ' ');
    }
}

int main(void) {
    solve(std::cin, std::cout);
    return 0;
}

Submission Info

Judge Result