This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub SSRS-cp/cp_library
#define PROBLEM "https://yukicoder.me/problems/no/1891" #include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; #include "../../data_structure/sequence/xor_segment_tree.hpp" #include "../../other/monoids/linear.hpp" int main(){ int N, Q; cin >> N >> Q; vector<linear> f(N); for (int i = 0; i < N; i++){ int a, b; cin >> a >> b; f[i] = linear(a, b); } xor_segment_tree<linear> F(f, composite, linear()); for (int i = 0; i < Q; i++){ int l, r, p, x; cin >> l >> r >> p >> x; cout << value(F.range_fold(l, r, p), x) << endl; } }
#line 1 "test/yukicoder/yuki_1891.test.cpp" #define PROBLEM "https://yukicoder.me/problems/no/1891" #include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; #line 2 "data_structure/sequence/xor_segment_tree.hpp" /** * @brief XOR セグメント木 */ template <typename T> struct xor_segment_tree{ int N; vector<vector<T>> ST; function<T(T, T)> f; T E; xor_segment_tree(vector<T> &A, function<T(T, T)> f, T E): f(f), E(E){ N = A.size(); ST = vector<vector<T>>(N * 2 - 1); for (int i = 0; i < N; i++){ ST[N - 1 + i].push_back(A[i]); } for (int i = N - 2; i >= 0; i--){ int cnt = ST[i * 2 + 1].size(); for (int j = 0; j < cnt; j++){ ST[i].push_back(f(ST[i * 2 + 1][j], ST[i * 2 + 2][j])); } for (int j = 0; j < cnt; j++){ ST[i].push_back(f(ST[i * 2 + 2][j], ST[i * 2 + 1][j])); } } } T range_fold(int L, int R, int x, int i, int l, int r){ if (r <= L || R <= l){ return E; } else if (L <= l && r <= R){ return ST[i][x]; } else { int p = (r - l) / 2; int m = (l + r) / 2; if ((x & p) == 0){ T resL = range_fold(L, R, x, i * 2 + 1, l, m); T resR = range_fold(L, R, x, i * 2 + 2, m, r); return f(resL, resR); } else { T resL = E; if (R >= m){ resL = range_fold(max(L, m) - p, R - p, x ^ p, i * 2 + 1, l, m); } T resR = E; if (L < m){ resR = range_fold(L + p, min(R, m) + p, x ^ p, i * 2 + 2, m, r); } return f(resR, resL); } } } T range_fold(int L, int R, int x){ return range_fold(L, R, x, 0, 0, N); } }; #line 2 "other/monoids/linear.hpp" struct linear{ long long a, b; linear(){ a = 1; b = 0; } linear(int a, int b): a(a), b(b){ } }; linear composite(linear A, linear B){ return linear(A.a * B.a % MOD, (A.b * B.a + B.b) % MOD); } int value(linear A, int x){ return (A.a * x + A.b) % MOD; } #line 7 "test/yukicoder/yuki_1891.test.cpp" int main(){ int N, Q; cin >> N >> Q; vector<linear> f(N); for (int i = 0; i < N; i++){ int a, b; cin >> a >> b; f[i] = linear(a, b); } xor_segment_tree<linear> F(f, composite, linear()); for (int i = 0; i < Q; i++){ int l, r, p, x; cin >> l >> r >> p >> x; cout << value(F.range_fold(l, r, p), x) << endl; } }