Commit f0bbd1a

committed

BIT2D less code

1 parent 0094d9d commit f0bbd1aCopy full SHA for f0bbd1a

File tree

-14

lines changed

-14

lines changed

Lines changed: 2 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -20,16 +20,8 @@ struct BIT2D {`
`20`	`20`	`return sum;`
`21`	`21`	`}`
`22`	`22`
`23`		`- void updateArea(int xi, int yi, int xf, int yf, int val){`
`24`		`- update(xi, yi, val);`
`25`		`- update(xf+1, yi, -val);`
`26`		`- update(xi, yf+1, -val);`
`27`		`- update(xf+1, yf+1, val);`
`28`		`- }`
`29`		`-`
`30`		`- int queryArea(int xi, int yi, int xf, int yf){`
`31`		`- return query(xf, yf) - query(xf, yi-1) - query(xi-1, yf) + query(xi-1, yi-1);`
`32`		`- }`
	`23`	`+ void updateArea(int xi, int yi, int xf, int yf, int val); //Same of BIT2DSparse`
	`24`	`+ int queryArea(int xi, int yi, int xf, int yf); //Same of BIT2DSparse`
`33`	`25`	`};`
`34`	`26`
`35`	`27`	`/LATEX_DESC_BEGIN**************************`

Lines changed: 2 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -18,9 +18,7 @@ struct BIT2D {`
`18`	`18`	`bit.resize(ord.size() + 1);`
`19`	`19`	`coord.resize(ord.size() + 1);`
`20`	`20`
`21`		`- sort(begin(pts), end(pts), [&](pii &a, pii &b){`
`22`		`- return a.second < b.second;`
`23`		`- });`
	`21`	`+ sort(begin(pts), end(pts), [&](pii &a, pii &b){ return a.second < b.second; });`
`24`	`22`
`25`	`23`	`for(auto [x, y] : pts)`
`26`	`24`	`for(int i=upper(ord, x); i < bit.size(); i += i&-i)`
`@@ -68,4 +66,4 @@ IMPORTANTE! Offline!`
`68`	`66`	`BIT2D(pts); // pts -> vecotor<pii> com todos os pontos em que serão feitas queries ou updates`
`69`	`67`
`70`	`68`	`Credits: TFG (TFG50 on Git: https://github.com/tfg50/Competitive-Programming/blob/master/Biblioteca/Data%20Structures/Bit2D.cpp)`
`71`		`-****************************LATEX_DESC_END/`
	`69`	`+****************************LATEX_DESC_END/`

Comments

(0)