結果

問題 No.8079 アルベド
ユーザー nonamae
提出日時 2022-07-12 12:57:54
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 488 ms / 2,000 ms
コード長 2,056 bytes
コンパイル時間 2,559 ms
コンパイル使用メモリ 207,424 KB
最終ジャッジ日時 2025-01-30 06:43:22
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using i64 = int_fast64_t;
int isqrt(i64 n) {
    return sqrtl(n);
}
__attribute__((target("avx2"), optimize("O3", "unroll-loops")))
i64 count_primes(const i64 n) {
    if (n <= 1) return 0;
    if (n == 2) return 1;
    const int v = isqrt(n);
    int s = (v + 1) / 2;
    vector<int> smalls(s); for (int i = 1; i < s; i++) smalls[i] = i;
    vector<int> roughs(s); for (int i = 0; i < s; i++) roughs[i] = 2 * i + 1;
    vector<i64> larges(s); for (int i = 0; i < s; i++) larges[i] = (n / (2 * i + 1) - 1) / 2;
    vector<bool> skip(v + 1);
    const auto divide = [](i64 n, i64 d) -> int { return (double)n / d; };
    const auto half = [](int n) -> int { return (n - 1) >> 1; };
    int pc = 0;
    for (int p = 3; p <= v; p += 2) if (!skip[p]) {
        int q = p * p;
        if ((i64)q * q > n) break;
        skip[p] = true;
        for (int i = q; i <= v; i += 2 * p) skip[i] = true;
        int ns = 0;
        for (int k = 0; k < s; k++) {
            int i = roughs[k];
            if (skip[i]) continue;
            i64 d = (i64)i * p;
            larges[ns] = larges[k] - (d <= v ? larges[smalls[d >> 1] - pc] : smalls[half(divide(n, d))]) + pc;
            roughs[ns++] = i;
        }
        s = ns;
        for (int i = half(v), j = ((v / p) - 1) | 1; j >= p; j -= 2) {
            int c = smalls[j >> 1] - pc;
            for (int e = (j * p) >> 1; i >= e; i--) smalls[i] -= c;
        }
        pc++;
    }
    larges[0] += (i64)(s + 2 * (pc - 1)) * (s - 1) / 2;
    for (int k = 1; k < s; k++) larges[0] -= larges[k];
    for (int l = 1; l < s; l++) {
        i64 q = roughs[l];
        i64 M = n / q;
        int e = smalls[half(M / q)] - pc;
        if (e < l + 1) break;
        i64 t = 0;
        for (int k = l + 1; k <= e; k++) t += smalls[half(divide(M, roughs[k]))];
        larges[0] += t - (i64)(e - l) * (pc + l - 1);
    }
    return larges[0] + 1;
}
int main() {
    i64 a, b;
    cin >> a;
    while (a--) {
        cin >> b;
        cout << count_primes(b) << '\n';
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0