結果
問題 | No.2571 列辞書順列 |
ユーザー |
👑 ![]() |
提出日時 | 2023-11-27 20:34:04 |
言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 326 ms / 3,000 ms |
コード長 | 4,473 bytes |
コンパイル時間 | 19,497 ms |
コンパイル使用メモリ | 262,508 KB |
最終ジャッジ日時 | 2025-02-18 02:02:23 |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 29 |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> #include <atcoder/all> #include <bitset> #include <cassert> #include <cmath> #include <ctime> #include <functional> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <random> #include <set> #include <stack> #include <string> #include <tuple> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; using namespace atcoder; typedef long long ll; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--) #define repk(i, k, n) for (int i = k; i < (int)(n); i++) #define all(v) v.begin(), v.end() #define mod1 1000000007 #define mod2 998244353 #define mod3 100000007 #define vi vector<int> #define vs vector<string> #define vc vector<char> #define vl vector<ll> #define vb vector<bool> #define vvi vector<vector<int>> #define vvc vector<vector<char>> #define vvl vector<vector<ll>> #define vvb vector<vector<bool>> #define vvvi vector<vector<vector<int>>> #define vvvl vector<vector<vector<ll>>> #define pii pair<int, int> #define pil pair<int, ll> #define pli pair<ll, int> #define pll pair<ll, ll> #define vpii vector<pair<int, int>> #define vpll vector<pair<ll, ll>> #define vvpii vector<vector<pair<int, int>>> #define vvpll vector<vector<pair<ll, ll>>> using mint = modint998244353; template <typename T> void debug(T e) { cerr << e << endl; } template <typename T> void debug(vector<T> &v) { rep(i, v.size()) { cerr << v[i] << " "; } cerr << endl; } template <typename T> void debug(vector<vector<T>> &v) { rep(i, v.size()) { rep(j, v[i].size()) { cerr << v[i][j] << " "; } cerr << endl; } } template <typename T> void debug(vector<pair<T, T>> &v) { rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; } } template <typename T> void debug(set<T> &st) { for (auto itr = st.begin(); itr != st.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(multiset<T> &ms) { for (auto itr = ms.begin(); itr != ms.end(); itr++) { cerr << *itr << " "; } cerr << endl; } template <typename T> void debug(map<T, T> &mp) { for (auto itr = mp.begin(); itr != mp.end(); itr++) { cerr << itr->first << " " << itr->second << endl; } } void debug_out() { cerr << endl; } template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << H << " "; debug_out(T...); } ll my_pow(ll x, ll n, ll mod) { // 繰り返し二乗法.x^nをmodで割った余り. ll ret; if (n == 0) { ret = 1; } else if (n % 2 == 1) { ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod; } else { ret = my_pow((x * x) % mod, n / 2, mod); } return ret; } ll inv(ll x, ll mod) { return my_pow(x, mod - 2, mod); } ll op(ll a, ll b) { return (a + b) % mod2; } ll e() { return 0LL; } int main() { ll N, M, K, Q; cin >> N >> M >> K >> Q; vector<ll> A(N); for (ll i = 0; i < N; i++) { cin >> A[i]; A[i]--; } ll inv_m = inv(M - 1, mod2); vector<ll> pow_m(N + 1); pow_m[0] = 1; for (ll i = 0; i < N; i++) { pow_m[i + 1] = (pow_m[i] * M) % mod2; } segtree<ll, op, e> seg1(N); segtree<ll, op, e> seg2(N); for (ll i = 0; i < N; i++) { seg1.set(i, (my_pow(M, K - i, mod2) * A[i]) % mod2); seg2.set(i, A[i]); } for (ll i = 0; i < Q; i++) { /*for (ll j = 0; j < N; j++) { cout << seg1.get(j) << " "; } cout << endl; for (ll j = 0; j < N; j++) { cout << seg2.get(j) << " "; } cout << endl;*/ ll t; cin >> t; if (t == 1) { ll l, r; cin >> l >> r; l--; r--; ll ans = (r - l + 1); ll prd1 = seg1.prod(l, r + 1); prd1 = (prd1 * pow_m[l]) % mod2; ll prd2 = seg2.prod(l, r + 1); ll sums = (prd1 + mod2 - prd2) % mod2; sums = (sums * inv_m) % mod2; ans = (ans + sums) % mod2; cout << ans << endl; } else { ll x, y; cin >> x >> y; x--; y--; seg1.set(x, (my_pow(M, K - x, mod2) * y) % mod2); seg2.set(x, y); } } }