I can't code today because of travel, just as the one that might run slow enough to geek out on benchmarking the various options. Does seem like it's a bit of a jump in difficulty from previous days.
Based on the slow trickle of results pt2 was very hard. But, having now got a good result, its not that difficult, but getting to that solution/algorithm took a lot of brain power.
Based on the star distribution today (everyone who has solved part 1 also solved part2) I suspect at least part 2 is easy even if I can't make a dent on part1 yet
yea becomes trivial if one uses a polygon library (I did too) but looking at the actual polygon, one can cook up some clever heuristics to do it quite quickly with some basic checks I think.
I'll check if someone created a guide for the clever solution, cos I'm interested. But I don't have nearly enough knowledge about geometry to came up with one myshelf. (nor energy after the 10 hour workdays in the last two weeks..)
8 Comments
Deebster@programming.dev · 2 pts · 275d
I can't code today because of travel, just as the one that might run slow enough to geek out on benchmarking the various options. Does seem like it's a bit of a jump in difficulty from previous days.
CameronDev@programming.dev · 2 pts · 275d
Based on the slow trickle of results pt2 was very hard. But, having now got a good result, its not that difficult, but getting to that solution/algorithm took a lot of brain power.
I hope todays is a little bit more relaxed.
Avicenna@programming.dev · 3 pts · 274d
wish not granted
CameronDev@programming.dev · 1 pts · 274d
Yeah, today is rough as well. I guess I jinxed it.
Avicenna@programming.dev · 1 pts · 272d
Based on the star distribution today (everyone who has solved part 1 also solved part2) I suspect at least part 2 is easy even if I can't make a dent on part1 yet
NominatedNemesis@reddthat.com · 1 pts · 273d
It was
easystaight forward brtue force:::: spoiler Spoiler
For speed the loop can be run paralelley.
I had no time to implent the contains myself, but pretty much all languages have a library already. :::
Avicenna@programming.dev · 2 pts · 273d
yea becomes trivial if one uses a polygon library (I did too) but looking at the actual polygon, one can cook up some clever heuristics to do it quite quickly with some basic checks I think.
NominatedNemesis@reddthat.com · 1 pts · 273d
I'll check if someone created a guide for the clever solution, cos I'm interested. But I don't have nearly enough knowledge about geometry to came up with one myshelf. (nor energy after the 10 hour workdays in the last two weeks..)