| commit | f30bc45268a74930d07cb9d752bea56932cb782f | |
| author | Eric Blake <eblake@redhat.com> | |
| Fri, 26 Jan 2024 12:52:47 +0000 (26 06:52 -0600) | ||
| committer | Eric Blake <eblake@redhat.com> | |
| Sat, 27 Jan 2024 16:15:31 +0000 (27 10:15 -0600) | ||
| tree | 95f5f1128a929c2fbad409ea26db24a5ba04aaf5 | treesnapshot (tar.gz zip) |
| parent | 99264f0a0195b8cc2a8495afdbee69003089d5f8 | commitdiff |
day 16 fix bug
The first splitter does not necessarily start the core. Instead, look
for all cells that can be visited more than once from the same
direction. My input didn't trigger this, but other inputs might.
This slows down the solution (I'm effectively making 2 passes instead
of 1), but the runtime is still better than 300ms.
The first splitter does not necessarily start the core. Instead, look
for all cells that can be visited more than once from the same
direction. My input didn't trigger this, but other inputs might.
This slows down the solution (I'm effectively making 2 passes instead
of 1), but the runtime is still better than 300ms.
| 2023/day16.m4 | diffblobblamehistory | |
| times.ods | diffblobblamehistory |