結果

問題 No.3026 Range LCM (Online Version)
コンテスト
ユーザー 横山緑
提出日時 2025-02-14 23:41:46
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
MLE  
実行時間 -
コード長 6,835 bytes
コンパイル時間 6,123 ms
コンパイル使用メモリ 449,200 KB
実行使用メモリ 814,720 KB
最終ジャッジ日時 2025-02-14 23:43:34
合計ジャッジ時間 45,055 ms
ジャッジサーバーID
（参考情報） 		judge7 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 10 MLE * 26
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "template.hpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;
// https://xn--kst.jp/blog/2019/08/29/cpp-comp/
// debug methods
// usage: debug(x,y);
// vector 出力できるように修正
template <typename T>
ostream& debug_print(ostream& os, const vector<T>& v) {
    os << "[";
    for (size_t i = 0; i < v.size(); ++i) {
        os << v[i];
        if (i < v.size() - 1) os << ", ";
    }
    os << "]";
    return os;
}
template <typename T>
ostream& debug_print(ostream& os, const T& var) {
    os << var;
    return os;
}
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) { cout << #x1 << ": "; debug_print(cout, x1) << endl; }
#define debug_2(x1, x2) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << endl; }
#define debug_3(x1, x2, x3) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << endl; }
#define debug_4(x1, x2, x3, x4) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << endl; }
#define debug_5(x1, x2, x3, x4, x5) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << ", " << #x5 << ": "; debug_print(cout, x5) << endl; }

#ifdef LOCAL
#define debug(...) CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~))(__VA_ARGS__)
#else
#define debug(...)
#endif

using ll = long long;
using vl = vector<ll>;
using Graph = vector<vector<ll>>;
using P = pair<ll, ll>;
#define all(v) v.begin(), v.end()
template <typename T> inline bool chmax(T &a, T b) {
    return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
    return ((a > b) ? (a = b, true) : (false));
}
#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)
// https://trap.jp/post/1224/
template <class... T> constexpr auto min(T... a) {
    return min(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> constexpr auto max(T... a) {
    return max(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> void input(T &...a) { (cin >> ... >> a); }
template <class T> void input(vector<T> &a) {
    for(T &x : a)
        cin >> x;
}
void print() { cout << '\n'; }
template <class T, class... Ts> void print(const T &a, const Ts &...b) {
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';
}
void print(const string &s) {
    cout << s << '\n';
}
template <class Container, typename = void>
struct is_container : std::false_type {};
template <class Container>
struct is_container<Container, std::void_t<decltype(std::declval<Container>().begin()), decltype(std::declval<Container>().end())>> : std::true_type {};
template <class Container>
typename enable_if<is_container<Container>::value>::type print(const Container& x) {
    if (!x.empty()) {
        auto it = x.begin();
        for (; it != prev(x.end()); ++it) {
            cout << *it << " ";
        }
        cout << *it << "\n";  // 最後の要素を出力して改行
    }
}
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    input(__VA_ARGS__)
#define LL(...)                                                                \
    long long __VA_ARGS__;                                                     \
    input(__VA_ARGS__)
#define STR(...)                                                               \
    string __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define REP1(a) for(ll i = 0; i < a; i++)
#define REP2(i, a) for(ll i = 0; i < a; i++)
#define REP3(i, a, b) for(ll i = a; i < b; i++)
#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)

ll inf = 3e18;
vl dx = {1, -1, 0, 0};
vl dy = {0, 0, 1, -1};
#line 3 "data_structure/sparse-table.hpp"
template <class T, auto op> struct SparseTable {
    SparseTable(const vector<T> &vec) {
        int n = vec.size();
        int b = bit_width(unsigned(n));
        v.resize(b);
        v[0] = vec;
        rep(i, b - 1) {
            v[i + 1].resize(n - (1 << i));
            rep(j, ssize(v[i]) - (1 << i)) {
                v[i + 1][j] = op(v[i][j], v[i][j + (1 << i)]);
            }
        }
    }
    T prod(int l, int r) const {
        if(l + 1 == r)
            return v[0][l];
        int b = bit_width(unsigned(r - l - 1)) - 1;
        return op(v[b][l], v[b][r - (1 << b)]);
    }

  private:
    vector<vector<T>> v;
};
#line 3 "/home/y_midori/cp/04_yukicoder/456/h.cpp"
#include <atcoder/modint>
// using namespace atcoder;
using mint = atcoder::modint998244353;
const ll maxi = 222222;
vector<int> sieve(maxi, 1);
void solve() {
    LL(n);
    vector<int> a(n);
    input(a);
    unordered_map<int, int> primes;
    vector<int> p;
    for(auto ai : a) {
        while(ai != 1) {
            if(!primes.contains(sieve[ai])) {
                primes[sieve[ai]] = primes.size();
                p.push_back(sieve[ai]);
            }
            ai /= sieve[ai];
        }
    }
    ll sz = primes.size();
    using S = vector<int>;
    auto op = [](S s, S t) {
        S res = move(s);
        rep(i, t.size()) chmax(res[i], t[i]);
        return res;
    };
    vector<S> v(n, S(sz, 0));
    rep(i, n) {
        int ai = a[i];
        while(ai != 1) {
            v[i][primes[sieve[ai]]]++;
            ai /= sieve[ai];
        }
        // debug(i, a[i]);
        // rep(j, sz) debug(p[j], v[i][j]);
    }
    SparseTable<S, op> st(v);
    ll prev = 1, x, y, z, w;
    LL(q);
    rep(i, q) {
        LL(aq, bq);
        x = aq * prev % 998244353;
        y = (x % n) + 1;
        z = bq * prev % 998244353;
        w = z % n + 1;
        ll l = min(y, w), r = max(y, w);
        // debug(l, r);
        auto s = st.prod(--l, r);
        mint ans = 1;
        rep(i, sz) {
            ans *= mint(p[i]).pow(s[i]);
        }
        print(ans.val());
        prev = ans.val();
    }
}
int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cout << std::setprecision(16);
    for(int i = 2; i < maxi; i++) {
        if(sieve[i] != 1)
            continue;
        sieve[i] = i;
        for(ll j = (ll)i * i; j < maxi; j += i) {
            sieve[j] = i;
        }
    }
    // rep(i, 1, 20) debug(i, sieve[i]);
    int t = 1;
    rep(_, t) {
        solve();
    }
}
0