3 ms·
My day 6 part 2 time was 46s, in a language fairly new to me and entirely manually (no automation at all). I just happened to have a solution that could quickly
by sokoloff 4y ago
My day 6 part 2 time was 46s, in a language fairly new to me and entirely manually (no automation at all). I just happened to have a solution that could quickly be changed to partition by 14 instead of 4
I’m not sure that just fast Part2 is that strong a signal. (I’m also not even sure that I think GPT is cheating any more than having pre-written frameworks, ready Dykstra, A*, and min-max solvers, automated input downloaders, scripted submission functions, etc. I don’t think any of those are cheating. GPT is more a grey area, I guess.)
- Waterluvian 4y agoIt sounds like AOC is very formulaic if there’s a set of things to come prepared with. Is it basically the same kinds of CS exam puzzles each year?
- sokoloff 4y agoIt’s going to have graph traversals, path optimization, input parsing, various flavors of map-reduce, and recursing every year. In that sense, it has a definite pattern, but I wouldn’t say I experience it as formulaic.
- xanathar 4y agoDefinitely agree on "recursing". Every year I curse a lot, multiple times.
- riffraff 4y agoAlso usually something with dynamic programming, something with primes, and something that you should/can solve with circular/doubly linked lists. It is basically a CS class. But the nice thing is that most puzzles have multiple solutions, it's always educational to read how other people did things!
- seba_dos1 4y agoI haven't been doing it this year, but looking at my answers from last year it looks like I have "cheated" day 24 part 2 and answered in 17 seconds (it was just a matter of adjusting a single range). There were also several "close calls" where it took me just slightly above one minute (day 2, 4 and 13).