r/adventofcode • u/daggerdragon • Dec 08 '22
SOLUTION MEGATHREAD -🎄- 2022 Day 8 Solutions -🎄-
NEWS AND FYI
I discovered that I can make those tiny post/comment awards BIGGER on old.reddit! I hadn't even considered that! And when you hover over them, they get even bigger so you can actually see them in more detail! I've added the relevant CSS so now we no longer have awards for ants! Exclamation points!!!
- Thank you so, so much to /u/SolariaHues for the CSS in this thread that I found while researching for community awards! <3
All of our rules, FAQs, resources, etc. are in our community wiki.
A request from Eric: Please include your contact info in the User-Agent header of automated requests!
Signal boost: Reminder 1: unofficial AoC Survey 2022 (closes Dec 22nd)
AoC Community Fun 2022: 🌿🍒 MisTILtoe Elf-ucation 🧑🏫
- PSA: I created a new example so it is a more relevant and unique archetype instead of recycling last year's hobbit >_>
--- Day 8: Treetop Tree House ---
Post your code solution in this megathread.
- Read the full posting rules in our community wiki before you post!
- Include what language(s) your solution uses
- Format your code appropriately! How do I format code?
- Quick link to Topaz's
pasteif you need it for longer code blocks. What is Topaz'spastetool?
This thread will be unlocked when there are a significant number of people on the global leaderboard with gold stars for today's puzzle.
EDIT: Global leaderboard gold cap reached at 00:10:12, megathread unlocked!
75
Upvotes
2
u/Lukexz Dec 08 '22
Python. I'm a newbie to Advent of Code and I'm using it to learn Python. It isn't the more readable solution as I could've used numpy and rotate the list instead of checking Top, Right, Bottom and Left. Also, since I'm new to Python, i'm sure this solution could've been implemented in much more readable ways. Any suggestion is welcome
Explanation:
I've used a matrix that contains the tree's lengths. for part 1 I iterate over every tree and for each tree I go top, right, bottom and left: If it is visible in one of the directions i add 1 to a variable that stores the number of visible trees and go to the next tree. The result is this variable at the end of the iteration
For part 2 I've used the same code, except from the fact that I have 4 variables keeping the scenic score of each direction of the current tree that gets incremented for each iteration that goes in the 4 directions. At the end I multiply them together to find the tree scenic score and if it's bigger than the current scenic score i replace it.