« first day (4535 days earlier)      last day (800 days later) » 

00:11
@MBraedley still hasn't done today!!!!
You really don't want to parse that with C++, ha
@MBraedley THis problem from last year had a very similiar input: adventofcode.com/2021/day/18
might be able to steal your solution from that
oh hey, it 's @InvaderSkoodge! How's the family?
 
2 hours later…
01:49
@Wipqozn Get ready -> Office just to drop stuff -> Dentist (same building as office) -> Office -> Home -> Eat -> Watch YouTube -> Play OW2 -> Now (or rather ~30min ago)
busy work day today, so didn't have time to look at AoC either.
@Wipqozn But the parsing is done, just have to do the pt1 comparisons
02:04
The important thing is the QC guy hasn't finished today either
02:26
my comparison functions aren't working right :{
02:55
Comparing [1,1,3,1,1] and [1,1,5,1,1]
lhs < rhs

Comparing [[1],[2,3,4]] and [[1],4]
Comparing [1] and [1]
Comparing [2,3,4] and [4]
lhs < rhs

Comparing [9] and [[8,7,6]]
Comparing [9] and [8,7,6]
lhs > rhs

Comparing [[4,4],4,4] and [[4,4],4,4,4]
Comparing [4,4] and [4,4]
lhs < rhs

Comparing [7,7,7,7] and [7,7,7]
lhs > rhs

Comparing [] and [3]
lhs < rhs

Comparing [[[]]] and [[]]
Comparing [[]] and []
lhs > rhs

Comparing [1,[2,[3,[4,[5,6,7]]]],8,9] and [1,[2,[3,[4,[5,6,0]]]],8,9]
Comparing [2,[3,[4,[5,6,7]]]] and [2,[3,[4,[5,6,0]]]]
Woo, parsing and comparisons working!
03:13
@Wipqozn Done!
Enjoy your 2 point lead while you still can
03:50
@MBraedley I was overthinking it this morning, just char by char parsing with a stack of Nodes, where Node is just a struct containing a vector<variant<int, Node*>> (but since I'm a good modern C++ programmer, I used shared_ptr, obviously)
 
7 hours later…
10:40
I just managed to get today's solution in under 100ms, my initial program took 600ms
11:30
@MBraedley How is OW2?
11:58
Still fun gameplay. I'm basically a one-trick on DPS and support player now with the new characters, so that's not great.
12:41
I found a sneaky trick and now my solution runs in 24ms
I didn't spend 2 hours on it, I was thinking about it when doing other work though
 
1 hour later…
14:00
@Ronan Yeah, I haven't started yet, but I have some thoughts on how to optimize at least part 1. I'll probably brute force it (since it is a part 1) though. But I also have an idea of what pt 2 is, which if I'm right will render my pt1 data structure mostly useless.
@Ronan I feel like this is the typical approach. Work on it on and off while doing the coding we're actually paid for, heh
@MBraedley If I ever try it, it won't be for a while. GPU finally died a month back, and I'm not really in a rush to replace it.
Glad you're enjoying it though. Communities reaction has been mixed.
@MBraedley I'm also just brute forcing part 1. Almost done, but have a medical appointment. Should finish this afternoon.
 
2 hours later…
15:56
I liked today's. JS sparse arrays made it pretty easy
16:19
Yeah, I'll be using a sparse set
 
1 hour later…
17:25
@MBraedley Part 2 wasn't what you were expecting then, because Brute Force works just fine.
I was expecting brute force miught fail for part 2 though... but it worked. Took a couple of seconds, but less than 5.
18:11
In the spirit of the season... And the Bridge... Advent Incremental
5
18:23
I'm just going to pin that to make people suffer
3
@Wipqozn Thanks
I posted it for the same reason
Christmas spirit alive and well!
2
@SaintWacko I have no idea what this is because it's blocked by work, but I'll star it anyways
2
I just wish I had discovered it earlier
We still have stars from November, we need to bring back The Bridge spirit and push away old stars!
2
18:54
@MBraedley Right?
It's slowed down so much :(
 
1 hour later…
20:17
@MBraedley I still remember when stars wouldn't last a day

« first day (4535 days earlier)      last day (800 days later) »