lrvideckis / programming_team_code Goto Github PK

Change the indexed set (GNU Policy Based Data-structure) include from:

#include <ext/pb_ds/assoc_container.hpp>

to

#include <bits/extc++.h>

Sometimes I have a hard time remembering disjoint set is in now in graphs

https://stackoverflow.com/questions/152555/h-or-hpp-for-your-class-definitions

Reference in KACTL: https://github.com/kth-competitive-programming/kactl/blob/main/content/contest/hash.sh [shell script]

Useful for catching Hackpack typos in contest.

https://github.com/lrvideckis/Programming-Team-Code/blob/master/stress-tests/test_utilities/graphGen.h#L107

Add a member function to the Fenwick Tree code supporting the find kth element in the Fenwick Tree operation in O(log(n)).

Using the current interface a lower-bound of O(log^2(n)) can be achieved.

https://codeforces.com/blog/entry/55686

If I'm using the struct, I may want access to lcp array and I don't want to call lcp function twice

Attempt putting include right in main function of tests

Reference: https://codeforces.com/blog/entry/100826 [binary lifting]

https://codeforces.com/blog/entry/83969

You can easily build it yourself, and this is to shorten the code

https://judge.yosupo.jp/problem/range_kth_smallest

In push, we always need to push lazy to children. This doesn't always happen on query as we don't create new nodes

Maybe clang?