結果

問題 No.590 Replacement
ユーザー PachicobuePachicobue
提出日時 2019-04-26 19:36:03
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 7,923 bytes
コンパイル時間 2,742 ms
コンパイル使用メモリ 221,724 KB
実行使用メモリ 27,372 KB
最終ジャッジ日時 2023-08-16 10:20:11
合計ジャッジ時間 9,953 ms
ジャッジサーバーID
(参考情報)
judge13 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 1 ms
4,380 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 WA -
testcase_23 WA -
testcase_24 WA -
testcase_25 WA -
testcase_26 WA -
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 2 ms
4,380 KB
testcase_34 AC 2 ms
4,376 KB
testcase_35 AC 2 ms
4,376 KB
testcase_36 AC 97 ms
7,716 KB
testcase_37 AC 98 ms
7,700 KB
testcase_38 AC 87 ms
7,548 KB
testcase_39 AC 87 ms
7,728 KB
testcase_40 AC 150 ms
13,264 KB
testcase_41 AC 145 ms
13,460 KB
testcase_42 AC 87 ms
8,072 KB
testcase_43 AC 86 ms
7,520 KB
testcase_44 AC 141 ms
27,372 KB
testcase_45 WA -
testcase_46 WA -
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
#define NDEBUG
#define SHOW(...) static_cast<void>(0)
//!===========================================================!//
//!  dP     dP                          dP                    !//
//!  88     88                          88                    !//
//!  88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b.  !//
//!  88     88  88ooood8 88'  '88 88'  '88 88ooood8 88'  '88  !//
//!  88     88  88.  ... 88.  .88 88.  .88 88.  ... 88        !//
//!  dP     dP  '88888P' '88888P8 '88888P8 '88888P' dP        !//
//!===========================================================!//
using ld = long double;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr unsigned int MOD = 1000000007;
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename F>
constexpr F PI = static_cast<F>(3.1415926535897932385);
std::mt19937 mt{std::random_device{}()};
template <typename T>
bool chmin(T& a, const T& b) { return a = std::min(a, b), a == b; }
template <typename T>
bool chmax(T& a, const T& b) { return a = std::max(a, b), a == b; }
template <typename T>
std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); }
template <class... Args>
auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); }
template <typename T>
constexpr T popCount(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : (T)__builtin_popcountll(u);
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f);
#endif
}
template <typename T>
constexpr T log2p1(const T u)
{
#ifdef __has_builtin
    return u == 0 ? T(0) : T(64 - __builtin_clzll(u));
#else
    unsigned long long v = static_cast<unsigned long long>(u);
    return v = static_cast<unsigned long long>(v), v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), popCount(v);
#endif
}
template <typename T>
constexpr T clog(const T v) { return v == 0 ? T(0) : log2p1(v - 1); }
template <typename T>
constexpr T msbp1(const T v) { return log2p1(v); }
template <typename T>
constexpr T lsbp1(const T v)
{
#ifdef __has_builtin
    return __builtin_ffsll(v);
#else
    return v == 0 ? T(0) : popCount((v & (-v)) - T(1)) + T(1);
#endif
}
template <typename T>
constexpr bool ispow2(const T v) { return popCount(v) == 1; }
template <typename T>
constexpr T ceil2(const T v) { return v == 0 ? T(1) : T(1) << log2p1(v - 1); }
template <typename T>
constexpr T floor2(const T v) { return v == 0 ? T(0) : T(1) << (log2p1(v) - 1); }
//!===============================================================!//
//!   88888888b            dP       .88888.   a88888b. 888888ba   !//
//!   88                   88      d8'   '88 d8'   '88 88    '8b  !//
//!  a88aaaa    dP.  .dP d8888P    88        88        88     88  !//
//!   88         '8bd8'    88      88   YP88 88        88     88  !//
//!   88         .d88b.    88      Y8.   .88 Y8.   .88 88    .8P  !//
//!   88888888P dP'  'dP   dP       '88888'   Y88888P' 8888888P   !//
//!===============================================================!//
template <typename T>
constexpr std::pair<T, T> extgcd(const T a, const T b)
{
    if (b == 0) { return std::pair<T, T>{1, 0}; }
    const auto p = extgcd(b, a % b);
    return {p.second, p.first - p.second * (a / b)};
}
template <typename T>
constexpr T inverse(const T a, const T mod) { return (mod + extgcd((mod + a % mod) % mod, mod).first % mod) % mod; }
//!=================================!//
//!   a88888b.  888888ba  d888888P  !//
//!  d8'   '88  88    '8b    88     !//
//!  88        a88aaaa8P'    88     !//
//!  88         88   '8b.    88     !//
//!  Y8.   .88  88     88    88     !//
//!   Y88888P'  dP     dP    dP     !//
//!=================================!//
template <typename T, typename InIt>
std::pair<T, T> CRT(const InIt first, const InIt last)
{
    using P = std::pair<T, T>;
    return std::accumulate(first, last, P{0, 1}, [](const P& a1, const P& a2) -> P {
        const T p1 = a1.second, m1 = a1.first, p2 = a2.second, m2 = a2.first, m = p1 * p2;
        if (m1 == m2) { return {m1, p1 * p2}; }
        auto p = extgcd(p1, p2);
        return {((((p1 * p.first % m) * (m2 - m1) + m1) % m) + m) % m, m};
    });
}
//!====================================================================================!//
//!    .88888.   a88888b. 888888ba        d88b       dP         a88888b. 8888ba.88ba   !//
//!   d8'   '88 d8'   '88 88    '8b       8''8       88        d8'   '88 88  '8b  '8b  !//
//!   88        88        88     88       d8b        88        88        88   88   88  !//
//!   88   YP88 88        88     88     d8P'8b       88        88        88   88   88  !//
//!   Y8.   .88 Y8.   .88 88    .8P     d8' '8bP     88        Y8.   .88 88   88   88  !//
//!    '88888'   Y88888P' 8888888P      '888P''YP    88888888P  Y88888P' dP   dP   dP  !//
//!====================================================================================!//
template <typename T>
constexpr T gcd(const T a, const T b) { return (b != 0) ? gcd(b, a % b) : a; }
template <typename T>
constexpr T lcm(const T a, const T b) { return (a == 0 and b == 0) ? (T)0 : (a / gcd(a, b)) * b; }
//!============================================!//
//!    8888ba.88ba             oo              !//
//!    88  '8b  '8b                            !//
//!    88   88   88  .d8888b.  dP  88d888b.    !//
//!    88   88   88  88'  '88  88  88'  '88    !//
//!    88   88   88  88.  .88  88  88    88    !//
//!    dP   dP   dP  '88888P8  dP  dP    dP    !//
//!============================================!//
int main()
{
    int N;
    std::cin >> N;
    std::vector<int> A(N), B(N);
    for (int i = 0; i < N; i++) { std::cin >> A[i], A[i]--; }
    for (int i = 0; i < N; i++) { std::cin >> B[i], B[i]--; }
    std::vector<std::vector<int>> cycle1;
    std::vector<int> C1(N, -1), D1(N, -1);
    for (int i = 0; i < N; i++) {
        if (C1[i] != -1) { continue; }
        std::vector<int> c;
        for (int p = i, d = 0; C1[p] == -1; p = A[p], d++) { C1[p] = (int)cycle1.size(), D1[p] = d, c.push_back(p); }
        cycle1.push_back(c);
    }
    std::vector<std::vector<int>> cycle2;
    std::vector<int> C2(N, -1), D2(N, -1);
    for (int i = 0; i < N; i++) {
        if (C2[i] != -1) { continue; }
        std::vector<int> c;
        for (int p = i, d = 0; C2[p] == -1; p = B[p], d++) { C2[p] = (int)cycle2.size(), D2[p] = d, c.push_back(p); }
        cycle2.push_back(c);
    }
    std::map<ll, std::vector<ll>> ds;
    for (int i = 0; i < N; i++) {
        const ll c1 = C1[i], c2 = C2[i], d = D2[i] - D1[i];
        const ll S1 = cycle1[c1].size(), S2 = cycle2[c2].size(), G = gcd(S1, S2), D = ((d % G) + G) % G;
        (D2[i] += S2 - D) %= S2;
        const ll C = c1 * N * N + c2 * N + D;
        using P = std::pair<ll, ll>;
        std::vector<P> mods{P{D1[i] % (S1 / G), S1 / G}, P{D2[i] % (S2 / G), S2 / G}, P{D1[i] % G, G}};
        ds[C].push_back(CRT<ll>(mods.begin(), mods.end()).first);
    }
    ll ans = 0;
    for (auto& p : ds) {
        const ll code = p.first, c1 = code / N / N, c2 = (code / N) % N, S1 = cycle1[c1].size(), S2 = cycle2[c2].size();
        const ll S = lcm(S1, S2);
        auto& v = p.second;
        std::sort(v.begin(), v.end());
        const int V = v.size();
        for (int i = 0; i < V; i++) {
            const ll dis = (i == V - 1 ? v[0] + S - v[i] - 1 : v[i + 1] - v[i] - 1);
            ans += (dis * (dis + 1)) / 2;
        }
    }
    std::cout << ans % MOD << std::endl;
    return 0;
}
0