felixm/aoc2023
Archived
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
Advent of Code 2023 solutions.
This repository has been archived on 2024-12-22. You can view files and clone it, but cannot push or open issues or pull requests.
15 Commits 1 Branch 0 Tags 179 KiB
Python 100%
30a8489313
Go to file
felixm 30a8489313 Do day 18.
2023-12-19 15:52:36 -05:00
.gitignore Solve 10 and 11. 2023-12-15 18:20:31 -05:00
d1.py Do day 1. 2023-12-01 22:51:14 -05:00
d2.py Do day 2. 2023-12-02 11:48:32 -05:00
d3.py Improve lib and use it to solve 3 and 17. 2023-12-17 23:57:55 -05:00
d4.py Do days 5 and 6. 2023-12-06 11:47:04 -05:00
d5.py Do days 5 and 6. 2023-12-06 11:47:04 -05:00
d6.py Do days 5 and 6. 2023-12-06 11:47:04 -05:00
d7.py Do day 7. 2023-12-07 23:57:38 -05:00
d8.py Do day 8 and add gcm and prime factors to lib. 2023-12-08 00:32:03 -05:00
d9.py Solve day 9 and fix horrible bug in lib. 2023-12-09 11:48:39 -05:00
d10.py Solve 10 and 11. 2023-12-15 18:20:31 -05:00
d11.py Solve 10 and 11. 2023-12-15 18:20:31 -05:00
d12.py Solve day 12. 2023-12-15 19:14:22 -05:00
d16.py Solve day 16. 2023-12-16 00:32:59 -05:00
d17.py Improve lib and use it to solve 3 and 17. 2023-12-17 23:57:55 -05:00
d18.py Do day 18. 2023-12-19 15:52:36 -05:00
dx.py Extend lib and solve day 17 with A*. Fun. 2023-12-17 22:07:11 -05:00
get.sh Solve 10 and 11. 2023-12-15 18:20:31 -05:00
lib.py Do day 18. 2023-12-19 15:52:36 -05:00
LICENSE Add license. 2023-12-02 11:52:06 -05:00
monitor.py Extend lib and solve day 17 with A*. Fun. 2023-12-17 22:07:11 -05:00
README.md Do day 18. 2023-12-19 15:52:36 -05:00

README.md

Times

  • Day 1: 40:00 (I don't know what I am doing.)
  • Day 2: 14:15 (Okay, but far way from leaderboard.)
  • Day 3: 1st 20:00, 2nd 70:00... (I had a logic error that took me a while to find.)
  • Day 4: 1st 9:06, 2nd 22:31; it wasn't hard but I didn't think quick enough :/
  • Day 5: 1st 25:00, 2nd 1:55:00; Required patience and accuracy
  • Day 6: 13:54; I was slow because I thought it is much harder?
  • Day 7: 75:00; leaderboard 16:00... that was just bad; no excuse
  • Day 8: 25:00; I was doing pretty decent here.
  • Day 9: 57:00; my input parse function did not consider negative values...
  • Day 10: 180:00; this one was hard for me.
  • Day 11: 68:00; okay but not elegant and way too slow ofc; x-ray solution would have been neat
  • Day 12: 52:00 and 22:00 for leaderboard; had the right idea and I am good at this type of problem
  • ...
  • Day 16: 00:27:30 745; best placement so far, of course still horribly slow
  • Day 17: a couple of hours; I realized that I need A* after a while; reused implementation from Project Euler but improved with heapq which was super fun
  • Day 18: a couple of hours; I realized that I need shoelace algo for part two but didn't realize that I have to compute the outer edges for a while and after I did, I still got clockwise/counter-clockwise issues. They could have made it meaner by using different clock directions for example and input.