A highly optimized collection of core data structures and classic algorithms optimized for competitive programming contests (ICPC Competitions, Codeforces, TopCoder, etc.). This repository serves as a permanent digital codebook, refined for fast copy-pasting, minimal constant-factor overhead, and strict C++11 standard environments.
- C++11 Compliance: Code structures strictly avoid post-C++11 language extensions to ensure seamless compilation on older contest servers (e.g., standard judge environments).
- Stack-Overflow Countermeasures: Massive structures allocation footprints use heap-backed storage models to entirely eliminate stack-exhaustion errors under deep recursion or massive limits.
- Amortized Execution Profiles: Algorithmic implementations focus heavily on optimizing tight loops to maximize execution speed against strict time limits.
βββ code/
β βββ data_structures/ # Highly optimized, encapsulated reference headers
βββ tests/
β βββ data_structures/ # Comprehensive unit verification boundaries
β βββ doctest.h # High-speed test framework engine
βββ .github/
βββ workflows/
βββ ci.yml # Automated compilation and validation scripts