Hello!

Problems:

Best Problem: https://dmoj.ca/problem/bsspc21j6

Second-Best Problem: https://dmoj.ca/problem/yac5p5

For Later: https://dmoj.ca/problem/cco21p1 https://dmoj.ca/problem/graffdefense https://dmoj.ca/problem/wc15c2j4

Very Fun Problems: https://dmoj.ca/problem/segments https://dmoj.ca/problem/skyscrapers https://dmoj.ca/problem/acc3p4 https://dmoj.ca/problem/tle16c4p4 https://dmoj.ca/problem/aac3p6 (Good Ad Hoc) https://dmoj.ca/problem/cco13p3 https://dmoj.ca/problem/cco19p2 https://dmoj.ca/problem/apio16p2 https://dmoj.ca/problem/cco22p2 https://dmoj.ca/problem/cco22p4 https://dmoj.ca/problem/dmpg16g3 https://dmoj.ca/problem/mockccc15s5 https://dmoj.ca/problem/ioi12p6 https://dmoj.ca/problem/coci07c1p6

Ugly but Fun Problems: https://dmoj.ca/problem/dmopc21c7p5 https://dmoj.ca/problem/dmopc21c5p6 https://dmoj.ca/problem/bsspc21s5 https://dmoj.ca/problem/dmopc21c10p5

Mega Super Extreme 🗑️ Problems (More accurately, problems I died too hard on): https://dmoj.ca/problem/oly19practice27 https://dmoj.ca/problem/ccc20s2hard (Constant optimization until you scream) https://dmoj.ca/problem/aac5p6

Problems I found annoying: https://dmoj.ca/problem/waterloow2017b https://dmoj.ca/problem/ccc04s5 https://dmoj.ca/problem/usaco21opens1 https://dmoj.ca/problem/wc17c2s3 https://dmoj.ca/problem/ccoprep3p2 (If not only for constraints) https://dmoj.ca/problem/coci18c1p4 https://dmoj.ca/problem/cco17p2

Problems I found less annoying: https://dmoj.ca/problem/bts17p6 https://dmoj.ca/problem/attraction https://dmoj.ca/problem/usaco21opens2 https://dmoj.ca/problem/aac2p3 (TL)

Aliens at home: https://dmoj.ca/problem/usaco18marg3

This exists: https://dmoj.ca/problem/dmopc23c1p6

Algorithm/Data Structure Visualizations:

segTrees: https://visualgo.net/en/segmenttree?slide=1

Treaps: https://people.ksp.sk/~kuko/gnarley-trees/Treap.html

Splay Trees: https://www.cs.usfca.edu/~galles/visualization/SplayTree.html

Link-Cut Trees: https://github.com/KhorunzhyiAl/Link-Cut-Treeez

Edmond-Karp: https://jamieheller.github.io/editor.html

Templates:

Java Fast readInt(), credit to yzhao123: https://pastebin.com/E4iMWMMh

Template Testing Problems:

Lazy Segment Tree: https://dmoj.ca/problem/dmopc15c1p6

LCA: https://dmoj.ca/problem/rte16s3

Rollback DSU: https://dmoj.ca/problem/mmcc15p1

Li Chao Tree/Convex Hull: https://dmoj.ca/problem/mmcc15p2, https://dmoj.ca/problem/mcco19c1d2p3

BBST: https://dmoj.ca/problem/ds4

1D/1D DP and Convex Hull: https://dmoj.ca/problem/dpz

Knuth's Optimization: https://dmoj.ca/problem/dmopc18c1p6

Heavy-Light Decomposition: https://dmoj.ca/problem/usaco19febgold1

CDQ D/Q: https://dmoj.ca/problem/ceoi17p4

Wavelet: https://dmoj.ca/problem/oly19practice4

Link/Cut Tree: https://dmoj.ca/problem/ds5easy

Persistent SegTree: https://dmoj.ca/problem/kthminnumber, https://dmoj.ca/problem/dmopc16c3p6 (Credit to Marshmellon)

Centroid Decomposition: https://dmoj.ca/problem/dmpg18s4

Virtual Tree: https://dmoj.ca/problem/joi14op1

Informal Journal:

Mock CCC is hard, orz (2/15/2021)

Java stole my internet points :RooRee: (5/23/2021)

Relationship with Java ended, C++ is my new friend (5/24/2021)

Cleaned up DMOJ Profile (1/24/2022)

I'm a Clown (2/16/2022)

Added Template Problems (3/28/2022)

Graduated (?) from Oly (6/11/2022)

Added external profiles (6/11/2022)

Apparently AtCoder nukes you if you register and don't participate (6/25/2022)

Notes to Self:

"as in you were allocating with new and had node *arr[10 << 20];? that is not good. more reasonable options include: -allocate with new, use pointers in nodes, only store a pointer to the root(s) of the tree -allocate a static array, use pointers in nodes -allocate a static array, use ints instead of pointers in nodes" -BalintR

If a graph is very sparse, vector > map > unordered map > gp hash table in terms of memory and speed, where x > y means that x is better than y (Thank you Riolku for helping to discover this.)