library
This documentation is automatically generated by online-judge-tools/verification-helper
Verify/LC_point_set_range_sort_range_composite.test.cpp
- View this file on GitHub
- Last update: 2024-04-26 03:32:16+09:00
- Problem: https://judge.yosupo.jp/problem/point_set_range_sort_range_composite
Depends on
- Segment Tree
(DataStructure/segtree.hpp)
- Sortable Segment Tree
(DataStructure/sortablesegtree.hpp)
- Modint
(Math/modint.hpp)
- Template/template.hpp
- Fast IO
(Utility/fastio.hpp)
Code
#define PROBLEM "https://judge.yosupo.jp/problem/point_set_range_sort_range_composite"
#include "Template/template.hpp"
#include "Utility/fastio.hpp"
#include "DataStructure/sortablesegtree.hpp"
#include "Math/modint.hpp"
using Fp=fp<998244353>;
using P=pair<Fp,Fp>;
P f(P a,P b){
return {a.first*b.first,b.first*a.second+b.second};
}
P g(P a,P b){return b;}
P m1(){return {1,0};}
int main(){
int n,q;
read(n,q);
vector<int> ps(n);
vector<P> vs(n);
rep(i,0,n)read(ps[i],vs[i].first.v,vs[i].second.v);
SortableSegmentTree<P,P,f,g,m1> seg(ps,vs);
while(q--){
int t;
read(t);
if(t==0){
int i,p,a,b;
read(i,p,a,b);
seg.update(i,p,P{a,b});
}
if(t==1){
int L,R,x;
read(L,R,x);
auto ab=seg.query(L,R);
Fp res=Fp(x)*ab.first+ab.second;
print(res.v);
}
if(t==2){
int L,R;
read(L,R);
seg.sort(L,R);
}
if(t==3){
int L,R;
read(L,R);
seg.sort(L,R,1);
}
}
return 0;
}#line 1 "Verify/LC_point_set_range_sort_range_composite.test.cpp"
#define PROBLEM "https://judge.yosupo.jp/problem/point_set_range_sort_range_composite"
#line 1 "Template/template.hpp"
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rrep(i, a, b) for (int i = (int)(b-1); i >= (int)(a); i--)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define SZ(v) (int)v.size()
#define MIN(v) *min_element(ALL(v))
#define MAX(v) *max_element(ALL(v))
#define LB(v, x) int(lower_bound(ALL(v), (x)) - (v).begin())
#define UB(v, x) int(upper_bound(ALL(v), (x)) - (v).begin())
using uint = unsigned int;
using ll = long long int;
using ull = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T, typename U> T ceil(T x, U y) {
assert(y != 0);
if (y < 0)
x = -x, y = -y;
return (x > 0 ? (x + y - 1) / y : x / y);
}
template <typename T, typename U> T floor(T x, U y) {
assert(y != 0);
if (y < 0)
x = -x, y = -y;
return (x > 0 ? x / y : (x - y + 1) / y);
}
template <typename T> int popcnt(T x) {
return __builtin_popcountll(x);
}
template <typename T> int topbit(T x) {
return (x == 0 ? -1 : 63 - __builtin_clzll(x));
}
template <typename T> int lowbit(T x) {
return (x == 0 ? -1 : __builtin_ctzll(x));
}
#ifdef LOCAL
#define show(...) _show(0, #__VA_ARGS__, __VA_ARGS__)
#else
#define show(...) true
#endif
template <typename T> void _show(int i, T name) {
cerr << '\n';
}
template <typename T1, typename T2, typename... T3>
void _show(int i, const T1 &a, const T2 &b, const T3 &...c) {
for (; a[i] != ',' && a[i] != '\0'; i++)
cerr << a[i];
cerr << ":" << b << " ";
_show(i + 1, a, c...);
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << "P(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T, template <class> class C>
ostream &operator<<(ostream &os, const C<T> &v) {
os << "[";
for (auto d : v)
os << d << ", ";
os << "]";
return os;
}
#line 2 "Utility/fastio.hpp"
#include <unistd.h>
namespace fastio {
static constexpr uint32_t SZ = 1 << 17;
char ibuf[SZ];
char obuf[SZ];
char out[100];
// pointer of ibuf, obuf
uint32_t pil = 0, pir = 0, por = 0;
struct Pre {
char num[10000][4];
constexpr Pre() : num() {
for (int i = 0; i < 10000; i++) {
int n = i;
for (int j = 3; j >= 0; j--) {
num[i][j] = n % 10 | '0';
n /= 10;
}
}
}
} constexpr pre;
inline void load() {
memmove(ibuf, ibuf + pil, pir - pil);
pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);
pil = 0;
if (pir < SZ)
ibuf[pir++] = '\n';
}
inline void flush() {
fwrite(obuf, 1, por, stdout);
por = 0;
}
void rd(char &c) {
do {
if (pil + 1 > pir)
load();
c = ibuf[pil++];
} while (isspace(c));
}
void rd(string &x) {
x.clear();
char c;
do {
if (pil + 1 > pir)
load();
c = ibuf[pil++];
} while (isspace(c));
do {
x += c;
if (pil == pir)
load();
c = ibuf[pil++];
} while (!isspace(c));
}
template <typename T> void rd_real(T &x) {
string s;
rd(s);
x = stod(s);
}
template <typename T> void rd_integer(T &x) {
if (pil + 100 > pir)
load();
char c;
do
c = ibuf[pil++];
while (c < '-');
bool minus = 0;
if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
if (c == '-') {
minus = 1, c = ibuf[pil++];
}
}
x = 0;
while ('0' <= c) {
x = x * 10 + (c & 15), c = ibuf[pil++];
}
if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
if (minus)
x = -x;
}
}
void rd(int &x) {
rd_integer(x);
}
void rd(ll &x) {
rd_integer(x);
}
void rd(i128 &x) {
rd_integer(x);
}
void rd(uint &x) {
rd_integer(x);
}
void rd(ull &x) {
rd_integer(x);
}
void rd(u128 &x) {
rd_integer(x);
}
void rd(double &x) {
rd_real(x);
}
void rd(long double &x) {
rd_real(x);
}
template <class T, class U> void rd(pair<T, U> &p) {
return rd(p.first), rd(p.second);
}
template <size_t N = 0, typename T> void rd_tuple(T &t) {
if constexpr (N < std::tuple_size<T>::value) {
auto &x = std::get<N>(t);
rd(x);
rd_tuple<N + 1>(t);
}
}
template <class... T> void rd(tuple<T...> &tpl) {
rd_tuple(tpl);
}
template <size_t N = 0, typename T> void rd(array<T, N> &x) {
for (auto &d : x)
rd(d);
}
template <class T> void rd(vector<T> &x) {
for (auto &d : x)
rd(d);
}
void read() {}
template <class H, class... T> void read(H &h, T &...t) {
rd(h), read(t...);
}
void wt(const char c) {
if (por == SZ)
flush();
obuf[por++] = c;
}
void wt(const string s) {
for (char c : s)
wt(c);
}
void wt(const char *s) {
size_t len = strlen(s);
for (size_t i = 0; i < len; i++)
wt(s[i]);
}
template <typename T> void wt_integer(T x) {
if (por > SZ - 100)
flush();
if (x < 0) {
obuf[por++] = '-', x = -x;
}
int outi;
for (outi = 96; x >= 10000; outi -= 4) {
memcpy(out + outi, pre.num[x % 10000], 4);
x /= 10000;
}
if (x >= 1000) {
memcpy(obuf + por, pre.num[x], 4);
por += 4;
} else if (x >= 100) {
memcpy(obuf + por, pre.num[x] + 1, 3);
por += 3;
} else if (x >= 10) {
int q = (x * 103) >> 10;
obuf[por] = q | '0';
obuf[por + 1] = (x - q * 10) | '0';
por += 2;
} else
obuf[por++] = x | '0';
memcpy(obuf + por, out + outi + 4, 96 - outi);
por += 96 - outi;
}
template <typename T> void wt_real(T x) {
ostringstream oss;
oss << fixed << setprecision(15) << double(x);
string s = oss.str();
wt(s);
}
void wt(int x) {
wt_integer(x);
}
void wt(ll x) {
wt_integer(x);
}
void wt(i128 x) {
wt_integer(x);
}
void wt(uint x) {
wt_integer(x);
}
void wt(ull x) {
wt_integer(x);
}
void wt(u128 x) {
wt_integer(x);
}
void wt(double x) {
wt_real(x);
}
void wt(long double x) {
wt_real(x);
}
template <class T, class U> void wt(const pair<T, U> val) {
wt(val.first);
wt(' ');
wt(val.second);
}
template <size_t N = 0, typename T> void wt_tuple(const T t) {
if constexpr (N < std::tuple_size<T>::value) {
if constexpr (N > 0) {
wt(' ');
}
const auto x = std::get<N>(t);
wt(x);
wt_tuple<N + 1>(t);
}
}
template <class... T> void wt(tuple<T...> tpl) {
wt_tuple(tpl);
}
template <class T, size_t S> void wt(const array<T, S> val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i)
wt(' ');
wt(val[i]);
}
}
template <class T> void wt(const vector<T> val) {
auto n = val.size();
for (size_t i = 0; i < n; i++) {
if (i)
wt(' ');
wt(val[i]);
}
}
void print() {
wt('\n');
}
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
wt(head);
if (sizeof...(Tail))
wt(' ');
print(forward<Tail>(tail)...);
}
void __attribute__((destructor)) _d() {
flush();
}
} // namespace fastio
using fastio::flush;
using fastio::print;
using fastio::read;
inline void first(bool i = true) {
print(i ? "first" : "second");
}
inline void Alice(bool i = true) {
print(i ? "Alice" : "Bob");
}
inline void yes(bool i = true) {
print(i ? "yes" : "no");
}
inline void Yes(bool i = true) {
print(i ? "Yes" : "No");
}
inline void No() {
print("No");
}
inline void YES(bool i = true) {
print(i ? "YES" : "NO");
}
inline void NO() {
print("NO");
}
inline void Yay(bool i = true) {
print(i ? "Yay!" : ":(");
}
inline void Possible(bool i = true) {
print(i ? "Possible" : "Impossible");
}
inline void POSSIBLE(bool i = true) {
print(i ? "POSSIBLE" : "IMPOSSIBLE");
}
/**
* @brief Fast IO
*/
#line 5 "Verify/LC_point_set_range_sort_range_composite.test.cpp"
#line 2 "DataStructure/segtree.hpp"
template<typename M,typename N,M (*f)(M,M),M (*g)(M,N),M (*m1)()>struct SegmentTree{
int n; vector<M> data;
SegmentTree(int _n=0){
n=1; while(n<_n)n<<=1; data.assign(2*n,m1());
}
void run(vector<M>& v){
for(int i=0;i<(int)v.size();i++)data[i+n]=v[i];
for(int k=n-1;k>0;k--)data[k]=f(data[2*k],data[2*k+1]);
}
void set(int k,const M &x){
k+=n; data[k]=x;
while(k>>=1)data[k]=f(data[2*k],data[2*k+1]);
}
void update(int k,const N &x){
k+=n; data[k]=g(data[k],x);
while(k>>=1)data[k]=f(data[2*k],data[2*k+1]);
}
M query(int a,int b){
M L=m1(),R=m1();
for(a+=n,b+=n;a<b;a>>=1,b>>=1){
if(a&1)L=f(L,data[a++]);
if(b&1)R=f(data[--b],R);
}
return f(L,R);
}
M operator[](const int &k)const{return data[k+n];}
};
/**
* @brief Segment Tree
*/
#line 3 "DataStructure/sortablesegtree.hpp"
template<typename M,typename N,M (*f)(M,M),M (*g)(M,N),M (*m1)(),int LG=30>struct SortableSegmentTree{
SortableSegmentTree(){}
SortableSegmentTree(vector<int>& ks,vector<M>& vs):n(ks.size()),seg(n),Es(n){
rep(i,0,n){
Ls.insert(i);
Es[i]=new Elem(ks[i],vs[i]);
seg.set(i,vs[i]);
}
Ls.insert(n);
}
void update(int i,int key,M val){
split(i);
split(i+1);
Es[i]=new Elem(key,val);
seg.set(i,val);
}
M query(int L,int R){
split(L);
split(R);
return seg.query(L,R);
}
void sort(int L,int R,bool rev=false){
split(L);
split(R);
int pos=L;
for(;;){
pos=*(Ls.upper_bound(pos));
if(pos>=R)break;
Es[L]=meld(Es[L],Es[pos]);
Es[pos]=new Elem();
seg.set(pos,m1());
Ls.erase(pos);
}
Es[L]->set(rev);
seg.set(L,Es[L]->value());
}
private:
struct Trie{
Trie *cp[2];
int sz;
M val,lav;
Trie(){cp[0]=cp[1]=nullptr;}
Trie(int key,M v){cp[0]=cp[1]=nullptr,init(key,v);}
void init(int key,M v,int lg=LG){
sz=1;
val=lav=v;
if(lg==-1)return;
if(!cp[key>>lg&1])cp[key>>lg&1]=new Trie();
cp[key>>lg&1]->init(key,v,lg-1);
}
void update(){
if(!cp[0] and !cp[1])return;
sz=0;
val=lav=m1();
if(cp[0]){
sz+=cp[0]->sz;
val=f(val,cp[0]->val);
lav=f(cp[0]->lav,lav);
}
if(cp[1]){
sz+=cp[1]->sz;
val=f(val,cp[1]->val);
lav=f(cp[1]->lav,lav);
}
}
void apply(N x){
assert(sz==1);
val=lav=g(val,x);
if(cp[0])cp[0]->apply(x);
if(cp[1])cp[1]->apply(x);
}
};
using Tp=Trie*;
int sz(Tp t){return t?t->sz:0;}
Tp meld(Tp a,Tp b){
if(!a)return b;
if(!b)return a;
a->cp[0]=meld(a->cp[0],b->cp[0]);
a->cp[1]=meld(a->cp[1],b->cp[1]);
a->update();
return a;
}
pair<Tp,Tp> split(Tp t,int k){
if(k==0)return {nullptr,t};
if(k==sz(t))return {t,nullptr};
if(k<sz(t->cp[0])){
auto [l,tmp]=split(t->cp[0],k);
auto L=new Trie();
L->cp[0]=l;
L->update();
auto R=new Trie();
R->cp[0]=tmp,R->cp[1]=t->cp[1];
R->update();
return {L,R};
}
else{
auto [tmp,r]=split(t->cp[1],k-sz(t->cp[0]));
auto L=new Trie();
auto R=new Trie();
L->cp[0]=t->cp[0],L->cp[1]=tmp;
L->update();
R->cp[1]=r;
R->update();
return {L,R};
}
}
struct Elem{
Tp node;
bool rev;
Elem():node(nullptr),rev(0){}
Elem(int key,M x):node(new Trie(key,x)),rev(0){}
Elem(Tp t,bool r):node(t),rev(r){}
void set(bool r){rev=r;}
void apply(N x){node->apply(x);}
M value(){return rev?node->lav:node->val;}
};
using Ep=Elem*;
Ep meld(Ep s,Ep t){
return new Elem(meld(s->node,t->node),0);
}
pair<Ep,Ep> split(Ep t,int k){
if(t->rev)k=sz(t->node)-k;
auto [L,R]=split(t->node,k);
if(t->rev)swap(L,R);
auto LE=new Elem(L,t->rev);
auto RE=new Elem(R,t->rev);
return {LE,RE};
}
const int n;
SegmentTree<M,N,f,g,m1> seg;
set<int> Ls;
vector<Ep> Es;
void split(int k){
if(k>=n)return;
int pos=*(--Ls.upper_bound(k));
if(pos==k)return;
auto [L,R]=split(Es[pos],k-pos);
Es[pos]=L,Es[k]=R;
seg.set(pos,Es[pos]->value());
seg.set(k,Es[k]->value());
Ls.insert(k);
}
};
/**
* @brief Sortable Segment Tree
*/
#line 2 "Math/modint.hpp"
template <unsigned mod = 1000000007> struct fp {
unsigned v;
static constexpr int get_mod() {
return mod;
}
constexpr unsigned inv() const {
assert(v != 0);
int x = v, y = mod, p = 1, q = 0, t = 0, tmp = 0;
while (y > 0) {
t = x / y;
x -= t * y, p -= t * q;
tmp = x, x = y, y = tmp;
tmp = p, p = q, q = tmp;
}
if (p < 0)
p += mod;
return p;
}
constexpr fp(ll x = 0) : v(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}
fp operator-() const {
return fp() - *this;
}
fp pow(ull t) {
fp res = 1, b = *this;
while (t) {
if (t & 1)
res *= b;
b *= b;
t >>= 1;
}
return res;
}
fp &operator+=(const fp &x) {
if ((v += x.v) >= mod)
v -= mod;
return *this;
}
fp &operator-=(const fp &x) {
if ((v += mod - x.v) >= mod)
v -= mod;
return *this;
}
fp &operator*=(const fp &x) {
v = ull(v) * x.v % mod;
return *this;
}
fp &operator/=(const fp &x) {
v = ull(v) * x.inv() % mod;
return *this;
}
fp operator+(const fp &x) const {
return fp(*this) += x;
}
fp operator-(const fp &x) const {
return fp(*this) -= x;
}
fp operator*(const fp &x) const {
return fp(*this) *= x;
}
fp operator/(const fp &x) const {
return fp(*this) /= x;
}
bool operator==(const fp &x) const {
return v == x.v;
}
bool operator!=(const fp &x) const {
return v != x.v;
}
friend istream &operator>>(istream &is, fp &x) {
return is >> x.v;
}
friend ostream &operator<<(ostream &os, const fp &x) {
return os << x.v;
}
};
template <unsigned mod> void rd(fp<mod> &x) {
fastio::rd(x.v);
}
template <unsigned mod> void wt(fp<mod> x) {
fastio::wt(x.v);
}
template <typename T> T Inv(ll n) {
static const int md = T::get_mod();
static vector<T> buf({0, 1});
assert(n > 0);
n %= md;
while (SZ(buf) <= n) {
int k = SZ(buf), q = (md + k - 1) / k;
buf.push_back(buf[k * q - md] * q);
}
return buf[n];
}
template <typename T> T Fact(ll n, bool inv = 0) {
static const int md = T::get_mod();
static vector<T> buf({1, 1}), ibuf({1, 1});
assert(n >= 0 and n < md);
while (SZ(buf) <= n) {
buf.push_back(buf.back() * SZ(buf));
ibuf.push_back(ibuf.back() * Inv<T>(SZ(ibuf)));
}
return inv ? ibuf[n] : buf[n];
}
template <typename T> T nPr(int n, int r, bool inv = 0) {
if (n < 0 || n < r || r < 0)
return 0;
return Fact<T>(n, inv) * Fact<T>(n - r, inv ^ 1);
}
template <typename T> T nCr(int n, int r, bool inv = 0) {
if (n < 0 || n < r || r < 0)
return 0;
return Fact<T>(n, inv) * Fact<T>(r, inv ^ 1) * Fact<T>(n - r, inv ^ 1);
}
template <typename T> T nHr(int n, int r, bool inv = 0) {
return nCr<T>(n + r - 1, r, inv);
}
/**
* @brief Modint
*/
#line 8 "Verify/LC_point_set_range_sort_range_composite.test.cpp"
using Fp=fp<998244353>;
using P=pair<Fp,Fp>;
P f(P a,P b){
return {a.first*b.first,b.first*a.second+b.second};
}
P g(P a,P b){return b;}
P m1(){return {1,0};}
int main(){
int n,q;
read(n,q);
vector<int> ps(n);
vector<P> vs(n);
rep(i,0,n)read(ps[i],vs[i].first.v,vs[i].second.v);
SortableSegmentTree<P,P,f,g,m1> seg(ps,vs);
while(q--){
int t;
read(t);
if(t==0){
int i,p,a,b;
read(i,p,a,b);
seg.update(i,p,P{a,b});
}
if(t==1){
int L,R,x;
read(L,R,x);
auto ab=seg.query(L,R);
Fp res=Fp(x)*ab.first+ab.second;
print(res.v);
}
if(t==2){
int L,R;
read(L,R);
seg.sort(L,R);
}
if(t==3){
int L,R;
read(L,R);
seg.sort(L,R,1);
}
}
return 0;
}