結果

問題 No.2758 RDQ
ユーザー iiljjiiljj
提出日時 2024-05-17 22:02:07
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 257 ms / 2,000 ms
コード長 13,854 bytes
コンパイル時間 2,459 ms
コンパイル使用メモリ 202,132 KB
実行使用メモリ 27,644 KB
最終ジャッジ日時 2024-05-17 23:44:56
合計ジャッジ時間 6,671 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
6,816 KB
testcase_01 AC 2 ms
6,944 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 252 ms
27,380 KB
testcase_07 AC 257 ms
27,644 KB
testcase_08 AC 252 ms
27,444 KB
testcase_09 AC 257 ms
27,208 KB
testcase_10 AC 253 ms
27,452 KB
testcase_11 AC 220 ms
13,440 KB
testcase_12 AC 216 ms
13,312 KB
testcase_13 AC 222 ms
13,568 KB
testcase_14 AC 209 ms
13,568 KB
testcase_15 AC 206 ms
13,792 KB
testcase_16 AC 205 ms
13,768 KB
testcase_17 AC 206 ms
13,696 KB
testcase_18 AC 207 ms
13,568 KB
testcase_19 AC 207 ms
13,312 KB
testcase_20 AC 211 ms
13,636 KB
testcase_21 AC 2 ms
6,940 KB
testcase_22 AC 2 ms
6,940 KB
testcase_23 AC 2 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d)                                                   \
    for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d)                                                  \
    for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d)                                                       \
    for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d)                                                      \
    for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c)                                                                \
    sort(ALL(c));                                                              \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

// 前方宣言
template <typename T> istream &operator>>(istream &is, vc<T> &vec);
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec);
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec);
template <typename T, size_t _Nm>
istream &operator>>(istream &is, array<T, _Nm> &arr);
template <typename T, size_t _Nm>
ostream &operator<<(ostream &os, const array<T, _Nm> &arr);
template <typename T, size_t _Nm>
ostream &operator>>(ostream &os, const array<T, _Nm> &arr);
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var);
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var);
template <class T> ostream &out_iter(ostream &os, const T &map_var);
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var);
template <typename T, typename U>
ostream &operator<<(ostream &os, const um<T, U> &map_var);
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var);
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var);
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var);
template <typename T>
ostream &operator<<(ostream &os, const queue<T> &queue_var);
template <typename T> ostream &operator<<(ostream &os, const stack<T> &stk_var);

template <typename T>
istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec)
        is >> x;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T>
ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm>
istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm>
ostream &operator<<(ostream &os,
                    const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end())
            os << ", ";
    }
    return os << "}";
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end())
            os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) {
    return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) {
    return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty())
            os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args>
ostream &operator<<(ostream &os, tuple<Args...> &a) {
    if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
        os << get<N>(a);
        if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
            os << ' ';
        } else if constexpr (end_line) {
            os << '\n';
        }
        return operator<< <N + 1, end_line>(os, a);
    }
    return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) {
    operator<< <0, true>(std::cout, a);
}

void pprint() { std::cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    std::cout << head;
    if (sizeof...(Tail) > 0)
        std::cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0)
        DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifndef MYLOCAL
#undef DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                              \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                            \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]"        \
            << endl                                                            \
            << "    ",                                                         \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                         \
    type __VA_ARGS__;                                                          \
    assert((std::cin >> __VA_ARGS__));

template <typename T> istream &operator,(istream &is, T &rhs) {
    return is >> rhs;
}
template <typename T> ostream &operator,(ostream &os, const T &rhs) {
    return os << ' ' << rhs;
}

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), std::cin.tie(nullptr),
            std::cout.tie(nullptr);
        std::cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH)
            std::cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { std::cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { std::cout << (p ? "YES" : "NO") << endl; }

template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i)
        v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i)
        v[i]++;
}

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

struct Sieve {
    int n;
    int sqrtn;
    vc<int> sieve; // sieve[i] := i の最小の素因数

    // コンストラクタ．前処理を行う．
    Sieve(int n) : n(n), sqrtn((int)sqrtl(n)), sieve(n + 1) {
        iota(ALL(sieve), 0); // 各要素をインデックスで初期化（0, 1, ...,
                             // n）．使用するのは 2, 3, ...
        REPM(i, 2, sqrtn) {
            if (sieve[i] < i)
                continue; // i は合成数
            // assert(i は素数)
            sieve[i] = i;
            // n 以下の任意の i の倍数 j について，j が i
            // 未満の素数で割れなかった場合
            REPMD(j, i * i, n, i)
            if (sieve[j] == j)
                sieve[j] = i; // j の最小の素因数は i
        }
    }

    // 素因数分解クエリ，O(log n)
    vc<int> pfd(int m) const {
        assert(m <= n);
        vc<int> prime_factors;
        while (m > 1) {
            prime_factors.push_back(sieve[m]);
            m /= sieve[m];
        }
        return prime_factors;
    }

    // 素因数分解クエリ，O(log n)
    map<int, int> pfd_map(int m) const {
        assert(m <= n);
        map<int, int> prime_factors; //
        while (m > 1) {
            prime_factors[sieve[m]]++;
            m /= sieve[m];
        }
        return prime_factors;
    }

    // m が素数かどうかを返す
    bool is_prime(const int m) const {
        return sieve[m] == m; //
    }

    // n 以下の素数一覧を返す
    vc<int> primes() const {
        vc<int> ret;
        REPM(i, 2, n) if (is_prime(i)) ret.push_back(i);
        return ret;
    }

    // a の約数を列挙する
    vc<int> devisors(const int a) const {
        assert(a <= n);
        map<int, int> mp = pfd_map(a);
        vc<pair<int, int>> V; // mp をベクトルに変換したもの
        for (auto pa : mp) {
            V.push_back(pa);
        }

        // 戻り値（入れ物）
        vc<int> Y;
        auto dfsd = [&Y, &V](auto &&dfsd, int cur_idx, int cur_val) -> void {
            if (cur_idx == (int)V.size()) {
                // 値が完成
                Y.push_back(cur_val);
                return;
            }
            const auto [v, c] = V[cur_idx];
            // p乗を全通り試す (0, ..., p乗)
            int mul = 1;
            REP(p, 0, c + 1) {
                dfsd(dfsd, cur_idx + 1, cur_val * mul);
                mul *= v;
            }
            return;
        };

        dfsd(dfsd, 0, 1);
        sort(ALL(Y));
        return Y;
    }
};

// Problem
void solve() {
    VAR(ll, n, q);
    vll a(n);
    cin >> a;
    vll l(q), r(q), k(q);
    REP(i, 0, q) cin >> l[i], r[i], k[i];
    l--;

    set<ll> st(ALL(k));
    Sieve s(100'000 + 11);

    // 約数ごとに，インデックスのリストを作る
    map<ll, vll> mp;
    REP(i, 0, n) {
        const vc<int> divisors = s.devisors(a[i]); //
        for (const auto &v : divisors) {
            if (not st.contains(v))
                continue;
            mp[v].push_back(i);
        }
    }

    vll ans(q, -1);
    REP(i, 0, q) {
        if (not mp.contains(k[i])) {
            ans[i] = 0;
            continue;
        }
        const auto lb = lower_bound(ALL(mp[k[i]]), l[i]);
        const auto ub = lower_bound(ALL(mp[k[i]]), r[i]);
        ans[i] = ub - lb;
    }

    REP(i, 0, q) {
        pprint(ans[i]); //
    }
}

// entry point
int main() {
    solve();
    return 0;
}
0