Skip to content

Add persistence lazy segment tree #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
ryanignatius wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Add persistence lazy segment tree #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
183 changes: 183 additions & 0 deletions src/persistentlazysegmenttree.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,183 @@
#include <bits/stdc++.h>

using namespace std;

typedef long long treeType;

class SegTree {
private:
const static int MAXN = 105000;
const static int SIZE = 30*MAXN;

int N;
int NODES;
int leftIdx[SIZE], rightIdx[SIZE];
treeType tree[SIZE];
treeType A[MAXN];
bool hasflag[SIZE];
treeType flag[SIZE];

int left(int node) {
return node*2;
}
int right(int node) {
return node*2+1;
}
int mid(int start, int end) {
return (start + end) / 2;
}

// adjust
void buildFunction(int p, treeType el) {
tree[p] = el;
}
void joinFunction(int p, treeType p1, treeType p2) {
tree[p] = p1 + p2;
}
void lazyFunction(int p, int node, treeType delta, int lef, int rig) {
flag[p] += delta;
tree[p] = tree[node] + (rig - lef + 1) * delta;
}
treeType updateFunction(int p, treeType val) {
return val;
}
treeType queryFunction(treeType t1, treeType t2) {
return t1 + t2;
}
void init() {
NODES = 0;
tree[0] = 0;
leftIdx[0] = 0;
rightIdx[0] = 0;
memset(hasflag, 0, sizeof hasflag);
memset(flag, 0, sizeof flag);
}
// end adjust

int newleaf(int value) {
int p = ++NODES;
leftIdx[p] = rightIdx[p] = 0;
buildFunction(p, value);
return p;
}
int newparent(int lef, int rig) {
int p = ++NODES;
leftIdx[p] = lef;
rightIdx[p] = rig;
joinFunction(p, tree[lef], tree[rig]);
return p;
}
int newlazykid(int node, treeType delta, int lef, int rig) {
int p = ++NODES;
leftIdx[p] = leftIdx[node];
rightIdx[p] = rightIdx[node];
flag[p] = flag[node];
hasflag[p] = true;
lazyFunction(p, node, delta, lef, rig);
return p;
}
void propagate(int p, int lef, int rig) {
if (hasflag[p]) {
if (lef != rig) {
leftIdx[p] = newlazykid(leftIdx[p], flag[p], lef, mid(lef, rig));
rightIdx[p] = newlazykid(rightIdx[p], flag[p], mid(lef, rig) + 1, rig);
}
hasflag[p] = false;
}
}
int build(int start, int end) {
if (start == end){
return newleaf(A[start]);
} else {
return newparent(build(start, mid(start, end)), build(mid(start, end)+1, end));
}
}
int update(int idx, treeType val, int p, int start, int end) {
if (start == end) return newleaf(updateFunction(p, val));
if (idx <= mid(start, end)) return newparent(update(idx, val, leftIdx[p], start, mid(start, end)), rightIdx[p]);
else return newparent(leftIdx[p], update(idx, val, rightIdx[p], mid(start, end) + 1, end));
}
treeType query(int p, int start, int end, int l, int r) {
if (end < start || r < start || end < l) return 0;
propagate(p, start, end);
if (l <= start && end <= r) return tree[p];
treeType p1 = query(leftIdx[p], start, mid(start, end), l, r);
treeType p2 = query(rightIdx[p], mid(start, end)+1, end, l, r);
return queryFunction(p1, p2);
}
int updateRange(int p, int l, int r, treeType val, int start, int end) {
if (end < start || r < start || end < l) return p;
propagate(p, start, end);
if (l <= start && end <= r) return newlazykid(p, val, start, end);
return newparent(updateRange(leftIdx[p], l, r, val, start, mid(start, end)), updateRange(rightIdx[p], l, r, val, mid(start, end) + 1, end));
}

public:
SegTree(int nn) {
N = nn;
init();
memset(A, 0, sizeof A);
}
SegTree(int nn, treeType *Arr) {
N = nn;
init();
for (int i=0; i<nn; i++) {
A[i] = Arr[i];
}
}
int build() {
return build(0, N-1);
}
int update(int root, int idx, treeType val) {
return update(idx, val, root, 0, N-1);
}
treeType query(int root, int l, int r) {
return query(root, 0, N-1, l, r);
}
int updateRange(int root, int l, int r, treeType val) {
return updateRange(root, l, r, val, 0, N-1);
}
};

SegTree *seg;

int main(){
treeType arr[] = {0,1,2,3,4,5,6,7,8,9,10};
seg = new SegTree(11, arr);
int r1 = seg->build();
cout << "Tes initial" << endl;
cout << seg->query(r1,1,1) << endl;
cout << seg->query(r1,1,2) << endl;
cout << seg->query(r1,1,3) << endl;
cout << seg->query(r1,1,4) << endl;
cout << seg->query(r1,1,5) << endl;
cout << seg->query(r1,1,6) << endl;
cout << seg->query(r1,1,7) << endl;
cout << seg->query(r1,1,8) << endl;
cout << seg->query(r1,1,9) << endl;
cout << seg->query(r1,1,10) << endl;
int r2 = seg->updateRange(r1, 4, 7, 10);
cout << "Tes use after update" << endl;
cout << seg->query(r2,1,1) << endl;
cout << seg->query(r2,1,2) << endl;
cout << seg->query(r2,1,3) << endl;
cout << seg->query(r2,1,4) << endl;
cout << seg->query(r2,1,5) << endl;
cout << seg->query(r2,1,6) << endl;
cout << seg->query(r2,1,7) << endl;
cout << seg->query(r2,1,8) << endl;
cout << seg->query(r2,1,9) << endl;
cout << seg->query(r2,1,10) << endl;
cout << "Tes use before update" << endl;
cout << seg->query(r1,1,10) << endl;
cout << seg->query(r1,2,10) << endl;
cout << seg->query(r1,3,10) << endl;
cout << seg->query(r1,4,10) << endl;
cout << seg->query(r1,5,10) << endl;
cout << seg->query(r1,6,10) << endl;
cout << seg->query(r1,7,10) << endl;
cout << seg->query(r1,8,10) << endl;
cout << seg->query(r1,9,10) << endl;
cout << seg->query(r1,10,10) << endl;
return 0;
}