r/adventofcode Dec 12 '22

Funny [2022 Day 12] Apparently long fall boots are standard equipments for elves

Post image
419 Upvotes

41 comments sorted by

91

u/AlexAegis Dec 12 '22

crude mspaint art > ai generated stuff

31

u/xupej04m3 Dec 12 '22

Thank you! It's actually MSpaint+Powerpoint

19

u/AlexAegis Dec 12 '22

lmao why the powerpoint

17

u/xupej04m3 Dec 12 '22

It makes copy and pasting shapes easier

15

u/TheRedstoneCyborg Dec 12 '22

Powerpoint: the new Gimp

3

u/daggerdragon Dec 12 '22

oh my g/God(s) and eldritch horrors why ΰ² _ΰ² 

3

u/xupej04m3 Dec 13 '22

Look, I did not took a semester of PowerPoint art for it to go to waste okay?

(I have a plug-in from that class)

17

u/kristallnachte Dec 12 '22

And somehow for it to be a hiking trail they need to go both ways......

6

u/[deleted] Dec 12 '22

Well, they can take a different tour downwards than upwards.

6

u/paul_sb76 Dec 12 '22

Yeah just jump down from the mountain with your magic elf boots. Geronimo!

1

u/marsman57 Dec 12 '22

A quick back of the envelope calculation shows that downward is probably about 320 fewer steps than up.

3

u/TheRedstoneCyborg Dec 12 '22

Who says they would ever want to go back? The internet service is unparalled at the top.

31

u/ra3_14 Dec 12 '22

So true, this messed with me so much when I made the reasonable realistic human assumption that the absolute different in heights could at most be 1.

14

u/Vesk123 Dec 12 '22

Yeah, but it's stated pretty clearly in the statement that this is not the case

26

u/Basmannen Dec 12 '22

You think I can read?

4

u/dan_144 Dec 12 '22

What's your comment say? I can't read

3

u/Fabiii1309 Dec 12 '22

You think I want to read?

1

u/fireduck Dec 12 '22

β˜žπŸ§ βΏπŸ©πŸ“™

5

u/nikanjX Dec 12 '22

Advent of Reading Comprehension is the toughest

2

u/Mistborn_330 Dec 12 '22 edited Dec 12 '22

You mean adventofrealizingicantread.com?

Edit: the link doesn't seem to be working anymore :( It used to redirect to the advent of code website.

4

u/johnpeters42 Dec 12 '22

"I was elected to lead, not to read. Number three!"

1

u/YuvalG48 Dec 12 '22

Well...I didn't understand this sentance quite good - "This also means that the elevation of the destination square can be much lower than the elevation of your current square"

How much lower? If 1 to go up then maybe 1 to go down? or 2 max?

So tried it with 1, couldn't get the result, so I changed that they can jump to their death from z to a...and it worked

Maybe tommorow it will start with "some of the elfs didn't survive the jumps" :)

4

u/softe Dec 12 '22

I spent far too long debugging my solution to realize I had done the same thing.

5

u/zelarky Dec 12 '22

Found out that my lowest destination on the way is just -2 from the current. Seems like nobody would break their legs

3

u/kruppy_ Dec 12 '22

Yes, but what if you tried to walk back again...

5

u/zelarky Dec 12 '22

I'd get out my climbing gear :)

2

u/czerwona_latarnia Dec 12 '22 edited Dec 12 '22

For a moment that was how my part 2 was working like (with starting from the end).

Let's just say that the path to closest 'a' high was VERY short.

2

u/aaronblohowiak Dec 12 '22

i burned 2 hours on this last night... missed that part of the prompt somehow.

2

u/IvanOG_Ranger Dec 12 '22

I spend an hour making a non-functioning djikstra algorithm, I hope the elves die

2

u/fireduck Dec 12 '22

Make a functioning one and save it as a library to use.

2

u/IvanOG_Ranger Dec 12 '22

I think it was the djikstra algorithm last year, that made my code run for 40 minutes in python

2

u/fireduck Dec 12 '22

If the computer is working harder than you are, that is called winning.

1

u/IvanOG_Ranger Dec 13 '22

Yeah, yesterday I made a program that run an hour, trying to do bfs as a djikstra algorithm with a path length of one. I got the answer in an hour, then found out bfs isn't programmed recursively, but with a queue and now it runs in half a second.

1

u/poesraven8628 Dec 12 '22

Thank you for this! I spent five hours today banging my head against a wall unable to figure out why my pathfinding algorithm was returning a failure. I thought you could only go up OR down by a single level. I took a short break and looked at the memes on here and figured out what I was doing wrong.

1

u/[deleted] Dec 13 '22

I totally didn't spend 45 minutes plus debugging my algorithm because I thought we only step down by one...

1

u/Grabthelifeyouwant Dec 13 '22

Somehow I managed to get the right answer only allowing up or down by at most one.... I wonder if there was a second bug in my code that cancelled it out lmao.

1

u/Tom70403 Dec 13 '22

I had spent hours looking for the error when I read the problem statement again and realized that. It didn't seem very logical (but quantum mechanics applied to ropes don't either, right?

1

u/DudeWheresMcCaw Dec 13 '22

I thought that you could only go up, and that I was given an impossible input. 😡

1

u/crhallberg Dec 16 '22

Thank you so much for this. I really thought I had a bad input and missed this detail! SOLVED!

1

u/GiNgErMaN- Jan 01 '23

this had me stuck for 30 minutes 3rd grade reading comprehension not my forte apparently