#342354 (C++17) No.590 Replacement

提出ソース

結果

問題	No.590 Replacement
ユーザー	Pachicobue
提出日時	2019-04-26 20:13:27
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	132 ms / 2,000 ms
コード長	11,594 bytes
コンパイル時間	2,592 ms
コンパイル使用メモリ	223,736 KB
実行使用メモリ	27,436 KB
最終ジャッジ日時	2024-05-03 19:44:19
合計ジャッジ時間	6,754 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	1 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	AC	2 ms 5,376 KB
testcase_05	AC	2 ms 5,376 KB
testcase_06	AC	1 ms 5,376 KB
testcase_07	AC	7 ms 5,376 KB
testcase_08	AC	4 ms 5,376 KB
testcase_09	AC	8 ms 5,376 KB
testcase_10	AC	5 ms 5,376 KB
testcase_11	AC	3 ms 5,376 KB
testcase_12	AC	8 ms 5,376 KB
testcase_13	AC	38 ms 5,376 KB
testcase_14	AC	58 ms 5,504 KB
testcase_15	AC	5 ms 5,376 KB
testcase_16	AC	14 ms 5,376 KB
testcase_17	AC	25 ms 5,376 KB
testcase_18	AC	85 ms 6,640 KB
testcase_19	AC	88 ms 6,740 KB
testcase_20	AC	22 ms 5,376 KB
testcase_21	AC	115 ms 7,364 KB
testcase_22	AC	106 ms 7,808 KB
testcase_23	AC	115 ms 7,464 KB
testcase_24	AC	116 ms 7,808 KB
testcase_25	AC	116 ms 7,680 KB
testcase_26	AC	119 ms 7,676 KB
testcase_27	AC	119 ms 7,684 KB
testcase_28	AC	118 ms 7,552 KB
testcase_29	AC	117 ms 7,552 KB
testcase_30	AC	121 ms 7,552 KB
testcase_31	AC	123 ms 7,652 KB
testcase_32	AC	132 ms 8,004 KB
testcase_33	AC	2 ms 5,376 KB
testcase_34	AC	2 ms 5,376 KB
testcase_35	AC	2 ms 5,376 KB
testcase_36	AC	84 ms 7,928 KB
testcase_37	AC	81 ms 7,928 KB
testcase_38	AC	78 ms 8,052 KB
testcase_39	AC	81 ms 7,928 KB
testcase_40	AC	120 ms 13,428 KB
testcase_41	AC	124 ms 13,556 KB
testcase_42	AC	75 ms 8,072 KB
testcase_43	AC	76 ms 7,600 KB
testcase_44	AC	127 ms 27,436 KB
testcase_45	AC	82 ms 7,924 KB
testcase_46	AC	77 ms 7,924 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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; }
//!====================================================================================!//
//!    .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                 dP    dP            dP    !//
//!  88  '8b  '8b                88    88            88    !//
//!  88   88   88 .d8888b. .d888b88    88 88d888b. d8888P  !//
//!  88   88   88 88'  '88 88'  '88    88 88'  '88   88    !//
//!  88   88   88 88.  .88 88.  .88    88 88    88   88    !//
//!  dP   dP   dP '88888P' '88888P8    dP dP    dP   dP    !//
//!========================================================!//
template <uint mod>
class ModInt
{
private:
    uint v;
    static uint norm(const uint& x) { return x < mod ? x : x - mod; }
    static ModInt make(const uint& x)
    {
        ModInt m;
        return m.v = x, m;
    }
    static ModInt power(ModInt x, ll n)
    {
        ModInt ans = 1;
        for (; n; n >>= 1, x *= x) {
            if (n & 1) { ans *= x; }
        }
        return ans;
    }
    static ModInt inv(const ModInt& x) { return ModInt{inverse((ll)x.v, (ll)mod)}; }

public:
    ModInt() : v{0} {}
    ModInt(const ll val) : v{norm(uint(val % (ll)mod + (ll)mod))} {}
    ModInt(const ModInt<mod>& n) : v{n()} {}
    explicit operator bool() const { return v != 0; }
    ModInt<mod>& operator=(const ModInt<mod>& n) { return v = n(), (*this); }
    ModInt<mod>& operator=(const ll val) { return v = norm(uint(val % (ll)mod + (ll)mod)), (*this); }
    ModInt<mod> operator+() const { return *this; }
    ModInt<mod> operator-() const { return make(norm(mod - v)); }
    ModInt<mod> operator+(const ModInt<mod>& val) const { return make(norm(v + val())); }
    ModInt<mod> operator-(const ModInt<mod>& val) const { return make(norm(v + mod - val())); }
    ModInt<mod> operator*(const ModInt<mod>& val) const { return make((uint)((ll)v * val() % (ll)mod)); }
    ModInt<mod> operator/(const ModInt<mod>& val) const { return *this * inv(val()); }
    ModInt<mod>& operator+=(const ModInt<mod>& val) { return *this = *this + val; }
    ModInt<mod>& operator-=(const ModInt<mod>& val) { return *this = *this - val; }
    ModInt<mod>& operator*=(const ModInt<mod>& val) { return *this = *this * val; }
    ModInt<mod>& operator/=(const ModInt<mod>& val) { return *this = *this / val; }
    ModInt<mod> operator+(const ll val) const { return ModInt{v + val}; }
    ModInt<mod> operator-(const ll val) const { return ModInt{v - val}; }
    ModInt<mod> operator*(const ll val) const { return ModInt{(ll)v * (val % mod)}; }
    ModInt<mod> operator/(const ll val) const { return ModInt{(ll)v * inv(val)}; }
    template <typename I>
    ModInt<mod> operator^(const I n) const { return power(v, n); }
    ModInt<mod>& operator+=(const ll val) { return *this = *this + val; }
    ModInt<mod>& operator-=(const ll val) { return *this = *this - val; }
    ModInt<mod>& operator*=(const ll val) { return *this = *this * val; }
    ModInt<mod>& operator/=(const ll val) { return *this = *this / val; }
    template <typename I>
    ModInt<mod>& operator^=(const I n) { return (*this) = ((*this) ^ n); }
    bool operator==(const ModInt<mod>& val) const { return v == val.v; }
    bool operator!=(const ModInt<mod>& val) const { return not(*this == val); }
    bool operator==(const ll val) const { return v == norm(uint((ll)mod + val % (ll)mod)); }
    bool operator!=(const ll val) const { return not(*this == val); }
    uint operator()() const { return v; }
};
template <uint mod>
inline ModInt<mod> operator+(const ll val, const ModInt<mod>& n) { return n + val; }
template <uint mod>
inline ModInt<mod> operator-(const ll val, const ModInt<mod>& n) { return ModInt<mod>{val - (ll)n()}; }
template <uint mod>
inline ModInt<mod> operator*(const ll val, const ModInt<mod>& n) { return n * val; }
template <uint mod>
inline ModInt<mod> operator/(const ll val, const ModInt<mod>& n) { return ModInt<mod>(val) / n; }
template <uint mod>
inline bool operator==(const ll val, const ModInt<mod>& n) { return n == val; }
template <uint mod>
inline bool operator!=(const ll val, const ModInt<mod>& n) { return not(val == n); }
template <uint mod>
inline std::istream& operator>>(std::istream& is, ModInt<mod>& n)
{
    uint v;
    return is >> v, n = v, is;
}
template <uint mod>
std::ostream& operator<<(std::ostream& os, const ModInt<mod>& n) { return (os << n()); }
//!============================================!//
//!    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()
{
    using mint = ModInt<MOD>;
    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 + 1) * (N + 1) + c2 * (N + 1) + D;
        using P = std::pair<ll, ll>;
        std::vector<P> mods;
        ll M1 = S1, V1 = D1[i], M2 = S2, V2 = D2[i];
        const auto p = extgcd(M1, M2);
        const ll S = lcm(S1, S2);
        const ll M = (S + ((M1 * p.first) * (V2 - V1) / (M1 * p.first + M2 * p.second) + V1) % S) % S;
        ds[C].push_back(M);
    }
    mint ans = 0;
    for (auto& p : ds) {
        const ll code = p.first, c1 = code / (N + 1) / (N + 1), c2 = (code / (N + 1)) % (N + 1), 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 mint dis = (i == V - 1 ? v[0] + S - v[i] - 1 : v[i + 1] - v[i] - 1);
            ans += ((dis) * (dis + 1)) / 2;
        }
    }
    std::cout << ans << std::endl;
    return 0;
}

yukicoder

結果

テストケース

ソースコード