Types & classes — github.com/Priyansh19077/CP-Templates

CodeHub MCPcopy Create free account

hub / github.com/Priyansh19077/CP-Templates / types & classes

Types & classes32 in github.com/Priyansh19077/CP-Templates

⨍ Functions 278◇ Types & classes 32

↓ 17 callersClassNode

String Algorithms/Trie.cpp:2

↓ 1 callersClassBinaryLifting

No need to change anything here

Tree Algorithms/HLD.cpp:3

↓ 1 callersClassLCA

No need to change anything here

Tree Algorithms/HLD.cpp:75

↓ 1 callersClassMoCmp

Range Queries/Mo_algo.cpp:7

↓ 1 callersClassTrie

String Algorithms/Trie.cpp:10

ClassBinaryLifting

Tree Algorithms/Binary_Lifting.cpp:1

ClassBinaryLifting

Tree Algorithms/LCA_tree.cpp:1

Graph Algorithms/EdmondsKarp.cpp:1

Graph Algorithms/FordFulkerson_Algo.cpp:1

Graph Algorithms/EdmondsKarp.cpp:7

Graph Algorithms/FordFulkerson_Algo.cpp:7

Tree Algorithms/HLD.cpp:196

String Algorithms/String_Hashing.cpp:1

Tree Algorithms/LCA_tree.cpp:69

Tree Algorithms/LCA_O_1.cpp:72

Range Queries/Lazy_SGT.cpp:8

Tree Algorithms/HLD.cpp:173

Tree Algorithms/LCA_O_1.cpp:51

Example: XOR aggregate (non-idempotent, use queryNormal)

Range Queries/Sparse_Table.cpp:48

Example: sum aggregate, point-set update

Range Queries/Segment_tree.cpp:59

Example: range-assign update, range-sum query

Range Queries/Lazy_SGT.cpp:84

Min node for idempotent queryIdempotent tests

tests/test_sparse_table.cpp:8

Example: sum of elements in each query range

Range Queries/Mo_algo.cpp:48

Range struct for counting distinct elements. Coordinate-compresses the array in its constructor so add/rem can work with a compact freq table instead

tests/test_mo_algo.cpp:10

Tree Algorithms/HLD.cpp:117

Range Queries/Segment_tree.cpp:8

ClassSparseTable

Tree Algorithms/LCA_O_1.cpp:2

ClassSparseTable

Range Queries/Sparse_Table.cpp:8

Union Find Algorithm Almost O(1) for reasonable size N. O(log*N) to be precise

Graph Algorithms/UnionFind.cpp:2

Tree Algorithms/HLD.cpp:186

Range Queries/Segment_tree.cpp:71

Range Queries/Lazy_SGT.cpp:96