結果

問題 No.2266 Fractions (hard)
ユーザー sotanishysotanishy
提出日時 2023-04-07 23:21:45
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,023 ms / 6,000 ms
コード長 4,859 bytes
コンパイル時間 4,842 ms
コンパイル使用メモリ 263,168 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-04-14 11:56:32
合計ジャッジ時間 17,945 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 24 ms
6,816 KB
testcase_01 AC 677 ms
6,812 KB
testcase_02 AC 335 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 8 ms
6,940 KB
testcase_05 AC 9 ms
6,940 KB
testcase_06 AC 59 ms
6,944 KB
testcase_07 AC 29 ms
6,944 KB
testcase_08 AC 8 ms
6,940 KB
testcase_09 AC 5 ms
6,940 KB
testcase_10 AC 5 ms
6,944 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 15 ms
6,944 KB
testcase_13 AC 575 ms
6,940 KB
testcase_14 AC 111 ms
6,944 KB
testcase_15 AC 125 ms
6,944 KB
testcase_16 AC 580 ms
6,944 KB
testcase_17 AC 496 ms
6,940 KB
testcase_18 AC 723 ms
6,944 KB
testcase_19 AC 689 ms
6,940 KB
testcase_20 AC 101 ms
6,940 KB
testcase_21 AC 740 ms
6,940 KB
testcase_22 AC 372 ms
6,944 KB
testcase_23 AC 141 ms
6,944 KB
testcase_24 AC 141 ms
6,940 KB
testcase_25 AC 917 ms
6,940 KB
testcase_26 AC 141 ms
6,940 KB
testcase_27 AC 655 ms
6,944 KB
testcase_28 AC 142 ms
6,940 KB
testcase_29 AC 141 ms
6,940 KB
testcase_30 AC 142 ms
6,944 KB
testcase_31 AC 141 ms
6,940 KB
testcase_32 AC 599 ms
6,944 KB
testcase_33 AC 2 ms
6,944 KB
testcase_34 AC 474 ms
6,940 KB
testcase_35 AC 478 ms
6,940 KB
testcase_36 AC 1,023 ms
6,940 KB
testcase_37 AC 815 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

#include <atcoder/all>
using namespace std;
using ll = long long;
#define rep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define revrep(i, t, s) for (int i = (int)(t)-1; i >= (int)(s); --i)
#define all(x) begin(x), end(x)
template <typename T>
bool chmax(T& a, const T& b) {
    return a < b ? (a = b, 1) : 0;
}
template <typename T>
bool chmin(T& a, const T& b) {
    return a > b ? (a = b, 1) : 0;
}

template <typename T>
std::vector<std::pair<T, T>> quotient_ranges(T n) {
    std::vector<std::pair<T, T>> ret;
    T i = 1;
    while (i <= n) {
        T q = n / i;
        T j = n / q + 1;
        ret.emplace_back(i, j);
        i = j;
    }
    return ret;
}

template <typename mint>
std::pair<std::vector<mint>, std::vector<mint>> totient_summatory_table(
    long long n) {
    if (n == 0) return {{0}, {0}};
    const int b = std::min(n, (long long)1e4);
    std::vector<mint> small(n / b + 1), large(b + 1);

    std::vector<int> totient(n / b + 1);
    std::iota(totient.begin(), totient.end(), 0);
    for (int i = 2; i <= n / b; ++i) {
        if (totient[i] != i) continue;
        for (int j = i; j <= n / b; j += i) {
            totient[j] = totient[j] / i * (i - 1);
        }
    }
    for (int i = 0; i < n / b; ++i) small[i + 1] = small[i] + totient[i + 1];

    for (int i = 1; i <= b; ++i) {
        mint k = n / i;
        large[i] = k * (k + 1) / 2;
    }
    for (long long i = b; i >= 1; --i) {
        for (long long l = 2; l <= n / i;) {
            long long q = n / (i * l), r = n / (i * q) + 1;
            large[i] -=
                (i * l <= b ? large[i * l] : small[n / (i * l)]) * (r - l);
            l = r;
        }
    }
    return {small, large};
}

std::pair<std::vector<int>, std::vector<int>> mertens_table(long long n) {
    if (n == 0) return {{0}, {0}};
    const int b = 1e4;
    std::vector<int> small(n / b + 1, 1), large(b + 1, 1);
    small[0] = large[0] = 0;

    std::vector<bool> prime(n / b + 1, true);
    for (int i = 2; i <= n / b; ++i) {
        if (!prime[i]) continue;
        for (int j = i; j <= n / b; j += i) {
            if (j > i) prime[j] = false;
            if ((j / i) % i == 0)
                small[j] = 0;
            else
                small[j] *= -1;
        }
    }
    for (int i = 1; i < n / b; ++i) small[i + 1] += small[i];

    for (long long i = b; i >= 1; --i) {
        for (long long l = 2; l <= n / i;) {
            long long q = n / (i * l), r = n / (i * q) + 1;
            large[i] -=
                (i * l <= b ? large[i * l] : small[n / (i * l)]) * (r - l);
            l = r;
        }
    }
    return {small, large};
}

using i128 = __int128_t;

i128 floor_sum(i128 n, i128 m, i128 a, i128 b) {
    i128 sum = 0;
    if (a >= m) {
        sum += (a / m) * n * (n - 1) / 2;
        a %= m;
    }
    if (b >= m) {
        sum += (b / m) * n;
        b %= m;
    }
    i128 y = (a * n + b) / m;
    if (y == 0) return sum;
    i128 x = (m * y - b + a - 1) / a;
    sum += (n - x) * y + floor_sum(y, a, m, a * x - m * y + b);
    return sum;
}

std::vector<int> moebius_table(int n) {
    std::vector<bool> prime(n + 1, true);
    std::vector<int> ret(n + 1, 1);
    for (int i = 2; i <= n; ++i) {
        if (!prime[i]) continue;
        for (int j = i; j <= n; j += i) {
            if (j > i) prime[j] = false;
            if ((j / i) % i == 0)
                ret[j] = 0;
            else
                ret[j] *= -1;
        }
    }
    return ret;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int N;
    ll K;
    cin >> N >> K;

    ll total = totient_summatory_table<ll>(N).second[1];

    if (K >= 2 * total) {
        cout << -1 << endl;
        return 0;
    }
    bool flip = false;
    if (K > total) {
        K = 2 * total - K;
        flip = true;
    }

    auto qr = quotient_ranges(N);
    vector<int> small, large;
    tie(small, large) = mertens_table(N);

    auto mertens = [&](ll n) -> ll {
        if (n < small.size()) return small[n];
        return large[N / n];
    };

    const i128 D = 1e16 + 1;
    i128 lb = 0, ub = D + 1;
    while (ub - lb > 1) {
        ll m = (lb + ub) / 2;
        ll cnt = 0;

        for (auto [l, r] : qr) {
            cnt +=
                (mertens(r - 1) - mertens(l - 1)) * floor_sum(N / l, D, m, m);
        }

        if (cnt < K) {
            lb = m;
        } else {
            ub = m;
        }
    }

    int lb2 = 0, ub2 = N + 1;
    while (ub2 - lb2 > 1) {
        int m2 = (lb2 + ub2) / 2;
        ll cnt = floor_sum(m2, D, ub, ub) - floor_sum(m2, D, ub - 1, ub - 1);
        if (cnt == 0) {
            lb2 = m2;
        } else {
            ub2 = m2;
        }
    }

    int d = ub2;
    int n = d * ub / D;
    if (flip) swap(d, n);
    cout << n << "/" << d << endl;
}
0