Set 16
Advanced Graphs — Implicit Graphs & Multi-source
Seven problems, ramping from Very Easy to Extreme.
Progress · 0/7 solved
- VERY EASYQ1Multi-Source BFS (Nearest Fire)
- EASYQ2Knight's Minimum Moves
- MEDIUMQ3SHA75-style Full Reachability with Precomputation
- MEDIUM-HARDQ40-1 BFS (Grid with Some Free Moves)
- HARDQ5Shortest Cycle Through a Given Edge / Node (mini)
- VERY HARDQ6Dijkstra with Path Reconstruction on Large Sparse Graph
- EXTREMEQ7Reachability Precomputation on Jump Graph With Weighted Cost (final boss graph problem)