結果

問題 No.3101 Range Eratosthenes Query
ユーザー rogi52
提出日時 2025-04-11 22:31:03
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 222 ms / 3,000 ms
コード長 11,501 bytes
コンパイル時間 4,105 ms
コンパイル使用メモリ 300,592 KB
実行使用メモリ 53,604 KB
最終ジャッジ日時 2025-04-11 22:31:27
合計ジャッジ時間 10,007 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 24
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/korogi/Desktop/cp-cpp/template.hpp"
#include <bits/stdc++.h>
using namespace std;

using i32 = int;
using i64 = long long;
using i128 = __int128;
using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = unsigned __int128;
using f32 = double;
using f64 = long double;
using f128 = __float128;

#define DMP(x) cout << "[" << __LINE__ << "]" << " " << #x << ":" << " " << x << endl;

#define FOR1(n)          for(int _ =  0 , n_ = (n); _ < n_; _++)
#define FOR2(i, n)       for(int i =  0 , n_ = (n); i < n_; i++)
#define FOR3(i, s, t)    for(int i = (s), t_ = (t); i < t_; i++)
#define FOR4(i, s, t, d) for(int i = (s), t_ = (t), d_ = (d); i < t_; i += d_)
#define OVERLOAD4(a, b, c, d, e, ...) e
#define FOR(...) OVERLOAD4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)

#define REV1(n)          for(int _ = (n) - 1; _ >=  0 ; _--)
#define REV2(i, n)       for(int i = (n) - 1; i >=  0 ; i--)
#define REV3(i, s, t)    for(int i = (t) - 1, s_ = (s); i >= s_; i--)
#define REV4(i, s, t, d) for(int i = (t) - 1, s_ = (s), d_ = (d); i >= s_; i -= d_)
#define OVERLOAD3(a, b, c, d, ...) d
#define REV(...) OVERLOAD4(__VA_ARGS__, REV4, REV3, REV2, REV1)(__VA_ARGS__)

#define FOR_SUBSET(T, S) for(int S_ = (S), T = S_; T >= 0; T = (T == 0 ? -1 : (T - 1) & S_))

#define MULTI for(int testcase_ = in(), testcase = 0; testcase < testcase_; testcase++) [&]

template < class T > using heap_max = priority_queue< T, vector< T >, less< T > >;
template < class T > using heap_min = priority_queue< T, vector< T >, greater< T >>;

template < class T, class U > bool chmin(T& a, const U& b) { return a > b ? a = b, 1 : 0; }
template < class T, class U > bool chmax(T& a, const U& b) { return a < b ? a = b, 1 : 0; }

i64 floor_div(const i64 n, const i64 d) { assert(d != 0); return n / d - ((n ^ d) <  0 && n % d != 0); }
i64  ceil_div(const i64 n, const i64 d) { assert(d != 0); return n / d + ((n ^ d) >= 0 && n % d != 0); }

template < class T, class F > T bin_search(T ok, T ng, F check) { while(abs(ok - ng) > 1) { T mid = (ok + ng) / 2; (check(mid) ? ok : ng) = mid; } return ok; }
template < class T, class F > T bin_search_real(T ok, T ng, F check, int step = 100) { FOR(step) { T mid = (ok + ng) / 2; (check(mid) ? ok : ng) = mid; } return ok; }

template < class T, class U > T accum(const vector< U >& a) { return accumulate(a.begin(), a.end(), T(0)); }
template < class T > pair< T, int > min(const vector< T >& a) { auto itr = min_element(a.begin(), a.end()); return {*itr, itr - a.begin()}; }
template < class T > pair< T, int > max(const vector< T >& a) { auto itr = max_element(a.begin(), a.end()); return {*itr, itr - a.begin()}; }
template < class T > void sort(vector< T >& a) { sort(a.begin(), a.end()); }
template < class T > void rsort(vector< T >& a) { sort(a.rbegin(), a.rend()); }
template < class T > void reverse(vector< T >& a) { reverse(a.begin(), a.end()); }
void sort(string& s) { sort(s.begin(), s.end()); }
void rsort(string& s) { sort(s.rbegin(), s.rend()); }
void reverse(string& s) { reverse(s.begin(), s.end()); }
template < class T, class Cmp > void sort(vector< T >& a, Cmp cmp) { sort(a.begin(), a.end(), cmp); }
template < class T > int LB(vector< T >& a, T x) { return distance(a.begin(), lower_bound(a.begin(), a.end(), x)); }
template < class T > int UB(vector< T >& a, T x) { return distance(a.begin(), upper_bound(a.begin(), a.end(), x)); }
template < class T > void unique(vector< T >& a) { sort(a.begin(), a.end()); a.erase(unique(a.begin(), a.end()), a.end()); }
vector<int> iota(int n) { vector<int> a(n); iota(a.begin(), a.end(), 0); return a; }

istream& operator >> (istream& is, i128& x) {
    string s; is >> s;
    int m = (s[0] == '-');
    x = 0;
    FOR(i, m, ssize(s)) x = x * 10 + (s[i] - '0');
    if(m) x *= -1;
    return is;
}
ostream& operator << (ostream& os, const i128& x) {
    if(x == 0) return os << '0';
    i128 y = x; if(y < 0) { os << '-'; y *= -1; }
    vector<int> ny;
    while(y) ny.push_back(y % 10), y /= 10;
    REV(i, ssize(ny)) os << ny[i];
    return os;
}
namespace scan {
struct x0 { template < class T > operator T() { T x; cin >> x; return x; } };
struct x1 { int n; x1(int n) : n(n) {} template < class T > operator vector< T >() { vector< T > a(n); for(T& x : a) cin >> x; return a; } };
struct x2 { int h, w; x2(int h, int w) : h(h), w(w) {} template < class T > operator vector< vector< T > >() { vector m(h, vector< T >(w)); for(vector< T >& a : m) for(T& x : a) cin >> x; return m; } };
struct cppio { cppio() { cin.tie(0); ios::sync_with_stdio(0); } } cppio_instance;
}
scan::x0 in() { return scan::x0(); }
scan::x1 in(int n) { return scan::x1(n); }
scan::x2 in(int h, int w) { return scan::x2(h, w); }

template < class T > ostream& operator << (ostream& os, const vector< T > a) {
    const int n = a.size();
    FOR(i, n) { os << a[i]; if(i + 1 != n) os << ' '; }
    return os;
}
template < class T > int print_n(const vector< T > a) { for(T x : a) cout << x << '\n'; return 0; }
int print() { cout << '\n'; return 0; }
template < class Head, class... Tail > int print(Head&& h, Tail&&... t) { cout << h; if(sizeof...(Tail)) cout << ' '; return print(forward<Tail>(t)...); }
namespace printer {
    void prec(int n) { cout << fixed << setprecision(n); }
    void flush() { cout.flush(); }
}

constexpr pair<int, int> dir4[] = {{-1, 0}, {0, -1}, {+1, 0}, {0, +1}};

vector<int>& operator ++ (vector<int>& a) { for(auto& e : a) e++; return a; }
vector<int>& operator -- (vector<int>& a) { for(auto& e : a) e--; return a; }
vector<int>  operator ++ (vector<int>& a, int) { vector<int> b = a; ++a; return b; }
vector<int>  operator -- (vector<int>& a, int) { vector<int> b = a; --a; return b; }

template < class T > vector<pair< T, int>> RLE(const vector< T >& a) { vector<pair< T, int>> v; for(const T& x : a) { if(not v.empty() and v.back().first == x) v.back().second++; else v.emplace_back(x, 1); } return v; }
vector<pair<char, int>> RLE(const string& s) { vector<pair<char, int>> v; for(const char& c : s) { if(not v.empty() and v.back().first == c) v.back().second++; else v.emplace_back(c, 1); } return v; }
template < class String, class Same > vector<String> RLE(const String& a, const Same same) { vector<String> v; for(const auto& x : a) { if(not v.empty() and same(v.back().back(), x)) v.back().push_back(x); else v.push_back({x}); } return v; }

int YESNO(bool yes) { return print(yes ? "YES" : "NO"); }
int YesNo(bool yes) { return print(yes ? "Yes" : "No"); }

constexpr i32 INF32 = 1e9;
constexpr i64 INF64 = 1e18;
#line 2 "/Users/korogi/Desktop/cp-cpp/ds/fwktree.hpp"

template < class CMonoid > struct fwktree {
  private:
    using M = CMonoid;
    using T = typename M::value_type;
    int n, n2;
    vector< T > a;

  public:
    fwktree() : fwktree(0) {}
    fwktree(int n) : n(n), a(n + 1, M::e()) { assert(M::comm()); }
    fwktree(const vector< T >& a_) : n(ssize(a_)), a(a_) {
        assert(M::comm());
        a.insert(a.begin(), {M::e()});
        for(int i = 1; i <= n; i++) {
            const int p = i + (i & -i);
            if(p <= n) a[p] = M::op(a[i], a[p]);
        }
    }
    // a[i] <- a[i] + x
    void add(int i, T x) {
        for(int p = i + 1; p <= n; p += p & -p) a[p] = M::op(a[p], x);
    }
    // [0, r)
    T pv(int r) {
        T s = M::e();
        for(int p = r; p > 0; p -= p & -p) s = M::op(a[p], s);
        return s;
    }
    // [l, r)
    T v(int l, int r) { return M::op(M::inv(pv(l)), pv(r)); }
    // a[i]
    T v(int i) { return v(i, i + 1); }
    // a[i] <- x
    void set(int i, T x) { add(i, M::op(M::inv(v(i)), x)); }
};
#line 2 "/Users/korogi/Desktop/cp-cpp/alg/sum.hpp"

namespace alg {
template < class T > struct sum {
    using value_type = T;
    static constexpr T op(const T& a, const T& b) { return a + b; }
    static constexpr T e() { return T(0); }
    static constexpr T inv(const T& a) { return -a; }
    static constexpr bool comm() { return true; }
};
}
#line 2 "/Users/korogi/Desktop/cp-cpp/nt/eratosthenes.hpp"

struct eratosthenes {
    int N;
    vector<int> isprime, primes, spf, mobius;
    eratosthenes(int N) : N(N), isprime(N + 1, 1), spf(N + 1, -1), mobius(N + 1, 1) {
        isprime[1] = 0;
        spf[1] = 1;
        for(int n = 2; n <= N; n++) if(isprime[n]) {
            primes.push_back(n);
            spf[n] = n;
            mobius[n] = -1;
            for(int m = n + n; m <= N; m += n) {
                isprime[m] = 0;
                if(spf[m] == -1) spf[m] = n;
                mobius[m] = ((m / n) % n == 0 ? 0 : -mobius[m]);
            }
        }
    }
    vector<pair<int, int>> factor(int n) {
        assert(1 <= n and n <= N);
        vector<pair<int, int>> pe;
        while(n > 1) {
            int p = spf[n], e = 0;
            while(spf[n] == p) n /= p, e++;
            pe.emplace_back(p, e);
        }
        return pe;
    }
    vector<int> divisor(int n) {
        vector<int> ds = {1};
        for(auto [p, e] : factor(n)) {
            FOR(i, ssize(ds)) {
                int x = 1;
                FOR(j, e) x *= p, ds.push_back(ds[i] * x);
            }
        }
        return ds;
    }
    int euler_phi(int n) {
        assert(1 <= n and n <= N);
        int phi = n;
        for(auto [p, e] : factor(n)) phi /= p, phi *= p - 1;
        return phi;
    }
    // a[n] <- sum_{n divides m} a[m]
    template < class T > void m_zeta(vector< T >& a) {
        const int n = ssize(a) - 1;
        assert(1 <= n and n <= N);
        for(int p : primes) { if(p <= n) for(int k = n / p; k >  0; k--) a[k] += a[k * p]; else break; }
    }
    template < class T > void m_mobius(vector< T > &a) {
        const int n = ssize(a) - 1;
        assert(1 <= n and n <= N);
        for(int p : primes) { if(p <= n) for(int k = 1; k * p <= n; k++) a[k] -= a[k * p]; else break; }
    }
    // a[n] <- sum_{d divides n} a[d]
    template < class T > void d_zeta(vector< T >& a) {
        const int n = ssize(a) - 1;
        assert(1 <= n and n <= N);
        for(int p : primes) { if(p <= n) for(int k = 1; k * p <= n; k++) a[k * p] += a[k]; else break; }
    }
    template < class T > void d_mobius(vector< T >& a) {
        const int n = ssize(a) - 1;
        assert(1 <= n and n <= N);
        for(int p : primes) { if(p <= n) for(int k = n / p; k >  0; k--) a[k * p] -= a[k]; else break; }
    }
    template < class T > vector< T > gcd_conv(vector< T > a, vector< T > b) {
        const int n = max(ssize(a), ssize(b));
        a.resize(n), b.resize(n);
        m_zeta(a); m_zeta(b);
        vector< T > c(n); FOR(i, n) c[i] = a[i] * b[i];
        m_mobius(c);
        return c;
    }
    template < class T > vector< T > lcm_conv(vector< T > a, vector< T > b) {
        const int n = max(ssize(a), ssize(b));
        a.resize(n, 0), b.resize(n, 0);
        d_zeta(a), d_zeta(b);
        vector< T > c(n); FOR(i, n) c[i] = a[i] * b[i];
        d_mobius(c);
        return c;
    }
};
#line 5 "a.cpp"
constexpr int M = 1e6;
eratosthenes sieve(M);

int main() {
    int Q = in();
    vector<int> ans(Q, 0);
    vector<vector<pair<int, int>>> Ls(M);
    FOR(i, Q) {
        int L = in(), R = in();
        if(L == 1) {
            ans[i] = 1;
        } else {
            Ls[R].push_back({L, i});
        }
    }

    fwktree<alg::sum<i64>> tree(M + 1);
    for(int R = 2; R <= M; R++) {
        const int d = R / sieve.spf[R];
        tree.add(d, -1);
        tree.add(R, +1);
        for(auto [L, i] : Ls[R]) ans[i] = tree.v(L, M + 1);
    }
    print_n(ans);
}
0