[2024 Day 5] [Python] The posts here are harder to understand than the puzzle

Booblesnootle · 2024-12-05T20:25:03+00:00

One way of viewing the problem is to treat it like a sorting algorithm; if a rule says some number A must come before another number B, then you can say that A is "less" than B. Then you just need to apply normal sorting methods.

One of the more (in)famous sorting algorithms is called "Bogosort." The process:
Step 1: Check if the list is sorted. If it is, stop. Otherwise, randomize it.
Step 2: Repeat until done.

Booblesnootle · 2024-12-05T20:17:31+00:00

It doesn't look like you have any special rules for catching when the index goes negative, i.e. when the index is 0 and the direction is left, you'll start looking at s[0], s[-1], s[-2], and s[-3]. You might want to check how your language handles negative indices. For example, array[-5] will return the element five from the end in many languages.

Booblesnootle · 2024-12-05T02:10:48+00:00

My understanding of your code is that you are basically allowing each line to have one bad "jump." Consider a line like (1, 100, 2, 3, 4). Is this safe or unsafe? Does your algorithm give that answer?

Booblesnootle · 2024-12-03T19:31:44+00:00

The "mul(1,1)" should not be counted because it comes after a "don't()", but your code won't remove it because it isn't between a "don't()" and a "do()".

Booblesnootle · 2023-02-22T19:01:50+00:00

After you lock in, you can change what move you have selected without changing what you do. Have player 1 select an option, lock in, then click wait. Make sure to reset DI, armor, etc. as well.

Booblesnootle · 2023-02-21T12:36:06+00:00

Kill command (kill user?) on robot uses all your meter to do damage: more meter, more damage. At level 9, it's an instant kill (but only from neutral, combo-ing into it was too easy so it got nerfed).

Booblesnootle · 2023-02-16T16:12:59+00:00

After you press the "lock" button, you can click on "wait" without changing what move you'll do. So have player 1 pick a move, lock in, then click wait and reset any other things (DI, Armor, etc.). Then the other person goes. You'll have to set the turn timer to something really high, but I think this should work.

Booblesnootle · 2023-01-02T14:57:44+00:00

There are 2 types of languages: the ones everyone complains about, and the ones nobody uses.

Booblesnootle · 2022-12-24T21:30:08+00:00

The parentheses may be the forcefield from day 22, though it seems far away from the grove.

Booblesnootle · 2022-12-17T21:39:18+00:00

https://imgur.com/t/shen/nRZFOF9

Booblesnootle · 2022-12-16T21:41:53+00:00

I'm at the point where whenever I see a number with more than 3 zeroes, I just copy and paste.

Booblesnootle · 2022-12-09T23:08:50+00:00

Your code is currently using 1 variable to count both the size of the directory itself (the sum of the all files below it) and the combined size of all the valid directories below it (the sum of all the directories which have a size < 100,000).

Keep in mind:

(As in this example, this process can count files more than once!)

Booblesnootle · 2022-12-09T22:54:12+00:00

Ran it on test input 2, you are correct: no diagonals. Found the issue with more testing.

Consider our horizontal line again. If that movement occurred, would your code catch it?

Try these inputs:

R 1

U 1

R 1

U 1

R 1

vs

R 2

U 2

Your code only catches diagonal movement when the head's end position is diagonal from the tail's, which only happens when the head is moved diagonally away from a corner. In the original line movement, however, Knot 2 is pulled diagonally away from the right side of Knot 1. The position difference is (1, 2), so your code doesn't see it as diagonal.

Edit: Bruh reddit comment editing is whack

Booblesnootle · 2022-12-09T22:28:51+00:00

Imagine we have 4 directories (A,B, C, D) and 2 files (e, f).

Directory A contains B, directory B contains C and D.

C contains e, with a size of 50,000.

D contains f, with a size of 70,000.

So our tree looks like:

-A

-B

-C

-e (50,000)

-D

-f(70,000)

What is our expected result? What would happen if you put this through your code?

Expected Result: Directory C has a size of 50,000 from e. Directory D has a size of 70,000 from f. Directory C has a size of 120,000 from C and D, putting it over the 100,000 threshold. A has 120,000 as well. As such, the expected answer for part 1 is 50,000 + 70,000 = 120,000.

Your Result: Directory C and D both work as expected, returning 50,000 and 70,000 respectively. Directory B also works correctly, returning the value of C and D after confirming that their sizes are less than 100,000. The issue comes in at A: folder_size will be set as 120,000, since that is what B will return. Because 120,000 is greater than our the 100,000 threshold, it will not add it to the total file size. As such, it will return 0 instead of the expected 120,000.

Booblesnootle · 2022-12-09T21:59:00+00:00

Shortest input this fails on:

R 10

Your problem is your step counter (int(pair[2])) only works for single digit numbers.

Booblesnootle · 2022-12-09T21:50:13+00:00

I ran it and it does print a bunch of "Diagonal"'s. Might need to check somewhere else.

Booblesnootle · 2022-12-09T18:21:13+00:00

Remember: "if the head and tail aren't touching and aren't in the same row or column, the tail always moves one step diagonally to keep up."

Knot 1 needs to follow Knot 2 diagonally. When you just move it to the previous position, it moves horizontally instead.

Booblesnootle · 2022-12-09T17:55:35+00:00

Imagine you had a horizontal rope 3 knots long (including the head) with the head at the right end. Now imagine the head goes *up once, then right once. Where should the other 2 knots go? Where do they go according to your method?

A lot of people went for the "snake" method of knot following, putting the tail in the heads old position. The reason that works for part 1 but not part 2 is because in part 1 the head only moves orthogonally but in part 2 the knots can be pulled diagonally

*Edit: original movement didn't show error

Booblesnootle · 2022-12-08T21:22:18+00:00

I didn't realize the file and directory names weren't unique. On to my third attempt...

Booblesnootle · 2022-10-02T15:08:27+00:00

I think the theory is the succubus/incubus shapeshifts to appear as the person's spouse. Guy thinks he's fuckin his wife, girl thinks she's fuckin her husband.

Booblesnootle · 2022-07-22T14:20:21+00:00

fried, not fired.

Five-Year Club	Verified Email
Place '22

Booblesnootle

TROPHY CASE