87 lines
No EOL
3.6 KiB
Markdown
87 lines
No EOL
3.6 KiB
Markdown
# Gold - 1DRQ
|
|
|
|
Author: Benjamin Qi
|
|
|
|
## Binary Indexed Tree
|
|
|
|
Assumes that you are familiar with prefix sum queries (CPH 9.1).
|
|
|
|
### Introduction
|
|
|
|
Given an array, the task is to update the element at a single position in addition to querying the sum of a prefix.
|
|
|
|
Sample Problems:
|
|
|
|
* [CSES Range Sum Queries II](https://cses.fi/problemset/task/1648)
|
|
* [CSES Range XOR Queries](https://cses.fi/problemset/task/1650)
|
|
* [SPOJ Inversion Counting](https://www.spoj.com/problems/INVCNT/)
|
|
|
|
The easiest way to do all of these tasks is with a **Binary Indexed Tree** (or Fenwick Tree).
|
|
|
|
Tutorials:
|
|
|
|
* CPH (very good)
|
|
* Section 9.2
|
|
* [CSAcademy BIT](https://csacademy.com/lesson/fenwick_trees) (also very good)
|
|
* [cp-algorithms Fenwick Tree](https://cp-algorithms.com/data_structures/fenwick.html)
|
|
* extends to range update range query, although this is not necessary for gold
|
|
* [Topcoder BIT](https://www.topcoder.com/community/data-science/data-science-tutorials/binary-indexed-trees/)
|
|
|
|
My implementation can be found [here](https://github.com/bqi343/USACO/blob/master/Implementations/content/data-structures/1D%20Range%20Queries%20(9.2)/BIT%20(9.2).h), and can compute range sum queries for any number of dimensions.
|
|
|
|
### Indexed Set
|
|
|
|
In the special case where all elements of the array are either zero or one (which is the case for several gold problems), users of C++ will find [indexed set](https://github.com/bqi343/USACO/blob/master/Implementations/content/data-structures/STL%20(5)/IndexedSet.h) useful. Using this, we can solve "Inversion Counting" in just a few lines (with template).
|
|
|
|
```cpp
|
|
#include <ext/pb_ds/tree_policy.hpp>
|
|
#include <ext/pb_ds/assoc_container.hpp>
|
|
using namespace __gnu_pbds;
|
|
template <class T> using Tree = tree<T, null_type, less<T>,
|
|
rb_tree_tag, tree_order_statistics_node_update>;
|
|
#define ook order_of_key
|
|
#define fbo find_by_order
|
|
|
|
int main() {
|
|
setIO();
|
|
int T; re(T);
|
|
F0R(i,T) {
|
|
int n; re(n);
|
|
Tree<int> T; ll numInv = 0;
|
|
F0R(j,n) { // T.ook(x+1) gives number of previous elements < (x+1)
|
|
int x; re(x); numInv += j-T.ook(x+1); // so this gives # previous elements > x
|
|
T.insert(x);
|
|
}
|
|
ps(numInv);
|
|
}
|
|
}
|
|
```
|
|
|
|
### Practice Problems
|
|
|
|
* USACO Gold
|
|
* The first three problems are just small variations on inversion counting.
|
|
* [Haircut](http://www.usaco.org/index.php?page=viewproblem2&cpid=1041)
|
|
* [Balanced Photo](http://www.usaco.org/index.php?page=viewproblem2&cpid=693)
|
|
* [Circle Cross](http://www.usaco.org/index.php?page=viewproblem2&cpid=719)
|
|
* [Sleepy Cow Sort](http://usaco.org/index.php?page=viewproblem2&cpid=898)
|
|
* [Out of Sorts (harder?)](http://www.usaco.org/index.php?page=viewproblem2&cpid=837)
|
|
* Other Problems:
|
|
* [Sorting Steps](https://csacademy.com/contest/round-42/task/sorting-steps/) [](42)
|
|
* I think this was a silver problem??
|
|
* [Cards](https://szkopul.edu.pl/problemset/problem/qpsk3ygf8MU7D_1Es0oc_xd8/site/?key=statement) [](81)
|
|
|
|
## Segment Tree + Related (update later?)
|
|
|
|
Segment trees allow you to perform any associative operation over ranges, not just summation or XOR. Although not required for any USACO gold problems, it can still be helpful.
|
|
|
|
* Range Minimum Query??
|
|
* Tutorial
|
|
* [Wikipedia](https://en.wikipedia.org/wiki/Range_minimum_query)
|
|
* Segment Tree
|
|
* Tutorial
|
|
* [CPC.3](https://github.com/SuprDewd/T-414-AFLV/tree/master/03_data_structures)
|
|
* [CSAcademy Tutorial](https://csacademy.com/lesson/segment_trees/)
|
|
* [Codeforces Tutorial](http://codeforces.com/blog/entry/18051)
|
|
* [USACO Springboards](http://www.usaco.org/index.php?page=viewproblem2&cpid=995)
|
|
* can use segment tree with min query |