noya2_Library
This documentation is automatically generated by online-judge-tools/verification-helper
data_structure/dynamic_segment_tree.hpp
- View this file on GitHub
- Last update: 2024-07-01 23:39:10+09:00
- Include:
#include "data_structure/dynamic_segment_tree.hpp"
Depends on
Verified with
Code
#pragma once
#include"../template/template.hpp"
namespace noya2{
template<class S, S(*op)(S, S), S(*e)()>
struct dynamic_segtree {
struct Node;
using Ptr = shared_ptr<Node>;
struct Node {
S val;
Ptr lch, rch, par;
Node (Ptr par_ = nullptr) : val(e()), lch(nullptr), rch(nullptr), par(par_) {}
};
Ptr root;
ll n;
dynamic_segtree (ll n_ = 0) : n(2){
while (n < n_) n <<= 1;
root = make_shared<Node>();
}
void set(ll idx, S val_){
assert(0 <= idx && idx < n);
ll le = 0, ri = n;
Ptr cur = root;
while (ri - le > 1){
ll md = (le + ri) / 2;
if (idx < md){
if (cur->lch == nullptr) cur->lch = make_shared<Node>(cur);
cur = cur->lch;
ri = md;
}
else {
if (cur->rch == nullptr) cur->rch = make_shared<Node>(cur);
cur = cur->rch;
le = md;
}
}
cur->val = val_;
while (cur->par){
cur = cur->par;
cur->val = op(get(cur->lch),get(cur->rch));
}
}
S prod(ll lid, ll rid){
assert(0 <= lid && lid <= rid && rid <= n);
if (lid == rid) return e();
Ptr cur = root;
ll le = 0, ri = n;
while (ri - le > 1){
ll md = (le + ri) / 2;
if (lid < md && md < rid){
if (lid == le && rid == ri) return cur->val;
return op(prod_l(cur->lch,le,md,lid),prod_r(cur->rch,md,ri,rid));
}
if (rid <= md){
if (cur->lch == nullptr) return e();
cur = cur->lch;
ri = md;
}
else {
if (cur->rch == nullptr) return e();
cur = cur->rch;
le = md;
}
}
return cur->val;
}
S get(Ptr ptr){
if (ptr) return ptr->val;
return e();
}
S prod_l(Ptr cur, ll le, ll ri, ll lid){
S prd = e();
while (cur){
ll md = (le + ri) / 2;
if (lid == le){
prd = op(cur->val,prd);
break;
}
if (lid < md){
prd = op(get(cur->rch),prd);
cur = cur->lch;
ri = md;
}
else {
cur = cur->rch;
le = md;
}
}
return prd;
}
S prod_r(Ptr cur, ll le, ll ri, ll rid){
S prd = e();
while (cur){
ll md = (le + ri) / 2;
if (rid == ri){
prd = op(prd,cur->val);
break;
}
if (rid > md){
prd = op(prd,get(cur->lch));
cur = cur->rch;
le = md;
}
else {
cur = cur->lch;
ri = md;
}
}
return prd;
}
S all_prod(){
return root->val;
}
S get(ll idx){
assert(0 <= idx && idx < n);
ll le = 0, ri = n;
Ptr cur = root;
while (ri - le > 1){
ll md = (le + ri) / 2;
if (idx < md){
if (cur->lch == nullptr) return e();
cur = cur->lch;
ri = md;
}
else {
if (cur->rch == nullptr) return e();
cur = cur->rch;
le = md;
}
}
return cur->val;
}
};
} // namespace noya2#line 2 "data_structure/dynamic_segment_tree.hpp"
#line 2 "template/template.hpp"
using namespace std;
#include<bits/stdc++.h>
#line 1 "template/inout_old.hpp"
namespace noya2 {
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
int s = (int)v.size();
for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
for (auto &x : v) is >> x;
return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
cout << t;
if (sizeof...(u)) cout << sep;
out(u...);
}
template<typename T>
void out(const vector<vector<T>> &vv){
int s = (int)vv.size();
for (int i = 0; i < s; i++) out(vv[i]);
}
struct IoSetup {
IoSetup(){
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetup_noya2;
} // namespace noya2
#line 1 "template/const.hpp"
namespace noya2{
const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 = 998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";
void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }
} // namespace noya2
#line 2 "template/utils.hpp"
#line 6 "template/utils.hpp"
namespace noya2{
unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
if (a == 0 || b == 0) return a + b;
int n = __builtin_ctzll(a); a >>= n;
int m = __builtin_ctzll(b); b >>= m;
while (a != b) {
int mm = __builtin_ctzll(a - b);
bool f = a > b;
unsigned long long c = f ? a : b;
b = f ? b : a;
a = (c - b) >> mm;
}
return a << std::min(n, m);
}
template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }
long long sqrt_fast(long long n) {
if (n <= 0) return 0;
long long x = sqrt(n);
while ((x + 1) * (x + 1) <= n) x++;
while (x * x > n) x--;
return x;
}
template<typename T> T floor_div(const T n, const T d) {
assert(d != 0);
return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}
template<typename T> T ceil_div(const T n, const T d) {
assert(d != 0);
return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}
template<typename T> void uniq(std::vector<T> &v){
std::sort(v.begin(),v.end());
v.erase(unique(v.begin(),v.end()),v.end());
}
template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }
template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }
template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }
} // namespace noya2
#line 8 "template/template.hpp"
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()
using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;
namespace noya2{
/* ~ (. _________ . /) */
}
using namespace noya2;
#line 4 "data_structure/dynamic_segment_tree.hpp"
namespace noya2{
template<class S, S(*op)(S, S), S(*e)()>
struct dynamic_segtree {
struct Node;
using Ptr = shared_ptr<Node>;
struct Node {
S val;
Ptr lch, rch, par;
Node (Ptr par_ = nullptr) : val(e()), lch(nullptr), rch(nullptr), par(par_) {}
};
Ptr root;
ll n;
dynamic_segtree (ll n_ = 0) : n(2){
while (n < n_) n <<= 1;
root = make_shared<Node>();
}
void set(ll idx, S val_){
assert(0 <= idx && idx < n);
ll le = 0, ri = n;
Ptr cur = root;
while (ri - le > 1){
ll md = (le + ri) / 2;
if (idx < md){
if (cur->lch == nullptr) cur->lch = make_shared<Node>(cur);
cur = cur->lch;
ri = md;
}
else {
if (cur->rch == nullptr) cur->rch = make_shared<Node>(cur);
cur = cur->rch;
le = md;
}
}
cur->val = val_;
while (cur->par){
cur = cur->par;
cur->val = op(get(cur->lch),get(cur->rch));
}
}
S prod(ll lid, ll rid){
assert(0 <= lid && lid <= rid && rid <= n);
if (lid == rid) return e();
Ptr cur = root;
ll le = 0, ri = n;
while (ri - le > 1){
ll md = (le + ri) / 2;
if (lid < md && md < rid){
if (lid == le && rid == ri) return cur->val;
return op(prod_l(cur->lch,le,md,lid),prod_r(cur->rch,md,ri,rid));
}
if (rid <= md){
if (cur->lch == nullptr) return e();
cur = cur->lch;
ri = md;
}
else {
if (cur->rch == nullptr) return e();
cur = cur->rch;
le = md;
}
}
return cur->val;
}
S get(Ptr ptr){
if (ptr) return ptr->val;
return e();
}
S prod_l(Ptr cur, ll le, ll ri, ll lid){
S prd = e();
while (cur){
ll md = (le + ri) / 2;
if (lid == le){
prd = op(cur->val,prd);
break;
}
if (lid < md){
prd = op(get(cur->rch),prd);
cur = cur->lch;
ri = md;
}
else {
cur = cur->rch;
le = md;
}
}
return prd;
}
S prod_r(Ptr cur, ll le, ll ri, ll rid){
S prd = e();
while (cur){
ll md = (le + ri) / 2;
if (rid == ri){
prd = op(prd,cur->val);
break;
}
if (rid > md){
prd = op(prd,get(cur->lch));
cur = cur->rch;
le = md;
}
else {
cur = cur->lch;
ri = md;
}
}
return prd;
}
S all_prod(){
return root->val;
}
S get(ll idx){
assert(0 <= idx && idx < n);
ll le = 0, ri = n;
Ptr cur = root;
while (ri - le > 1){
ll md = (le + ri) / 2;
if (idx < md){
if (cur->lch == nullptr) return e();
cur = cur->lch;
ri = md;
}
else {
if (cur->rch == nullptr) return e();
cur = cur->rch;
le = md;
}
}
return cur->val;
}
};
} // namespace noya2