mirror of
https://github.com/peter-tanner/advent-of-code-2022.git
synced 2024-11-30 06:10:22 +08:00
Peter
98eeb321d1
got both answers first try! slow af solution. I hoped that keeping the solution O(j) would be quick enough and seems like it is, takes around ~10 seconds to complete but that is achievable. For each j it breaks the row into intervals generated based on the taxicab radius. The intervals are simplified by sorting and joining. |
||
|---|---|---|
| .. | ||
| src | ||
| Cargo.toml | ||