Advent of Code 2022 - Day 1

[cymplecy]

https://adventofcode.com

This is a thread to discuss Day1 (which starts on 1st December at 05:00 UTC )

https://adventofcode.com/2022/day/1

REMEMBER!
It is VERY important NOT to write any public spoilers
ALWAYS keep spoiler stuff hidden inside one of these

Summary

This text will be hidden

which you can obtain by clicking on the gear icon

Good luck
FYI one of the features of Advent of Code is that we all get given different inputs so our answers will be different.
The examples are all the same but each of us gets different inputs for us to solve

[d4s_over_dt4]

Hmmmm...What does this stuff do?
ownerproof-975346-1669803213-faa472628fff
(im just joking see i erased last 3 bits)

[mr_owlssssnap2]

Ooh! Is this like a daily game jam?

[clowestick]

DONT POST THAT THAT IS USED TO PROVE YOU OWN YOUR ACCOUNT(which is important)

[cymplecy]

Day 1 - my solution

Snap! Build Your Own Blocks

[d4s_over_dt4]

Mmmm...Seems like a beginner stage c++ puzzle!
I'll do it in python.

Summary

a="""long string"""
a=a.split("\n\n")
a=list(map(lambda x:list(map(int,x.split("\n"))),a))
max(a)
a.sort()
sum(a[-3:])

TF WHO FLAGGED THIS ITS NOT INAPPROPIATE IN ANY REASON

[d4s_over_dt4]

I'm just used to python

[jadga]

Here's my solution.
I made a block but it works exactly like yours, Simon!

my Block

Hope I'll make it to the end this year, last year I gave up after day 5 or so

[clowestick]

nvm im too new to coding

[ego-lay_atman-bay]

Her's my solution

Part 1

Part 2

And here's my project Snap! Build Your Own Blocks

[mr_owlssssnap2]

uhhhhh.. huh?

Is the 4th elf not the correct answer??

[loucheman]

My solution

Part 1

(I had forgotten the existence of the sum block! hahaha)

Part 2

project

[mr_owlssssnap2]

can someone help me pls i dont understand this

edit: oh wait im stupid one sec dont help me

[d4s_over_dt4]

Summary

a=[long list of stuff]
for i in a:
c=list("XYZ").index(i[2])+1
if i in ["A Z","B X","C Y"]:
b+=c
elif i in ["A X","B Y","C Z"]:
b+=c+3
else:
b+=c+6
b
b=0
d=dict(zip(["A X","B X","C X","A Y", "B Y","C Y","A Z","B Z","C Z"],[3,1,2,4,5,6,8,9,7]))
for i in a:
b+=d[i]
b

Flaggers

[mr_owlssssnap2]

ohhh my godddd i made the block but the day 1 input is soo longg the block takes so long to do it
and putting it in a warp lags it :(

[cymplecy]

Do want to show us your block - we could maybe see where the delay is occuring?

Remember to put it inside of a

Summary

This text will be hidden

So that only people who've already done it or are not taking part can look at it

[mr_owlssssnap2]

one second

Summary

Snap! Build Your Own Blocks

the variable thats in there is the input

the block is a lot more complicated that yours, but thats because i really didnt know what to do lol

[mr_owlssssnap2]

it finds the highest number, which is what it wants us to do, but the input hundreds of lines long it takes a very long time to do all of it

edit: wait, theres 2 parts to this puzzle?

[cymplecy]

Before trying to speed it up - I'd make sure that your code works for the test data (which I don't think it does at the moment)

Once, you've got it working for that - then move onto your real data

[mr_owlssssnap2]

OH MY GOD IM DUMBB AHHHH

i didnt read the puzzle right