24/15; points: 163, 17th place
- OMFG, awesome start
- add max(n) and all related functions
59/12; points: 131, 5th place
- WHU??
- Hardcoded stuff, seems like I wasn't the only one
- Lost quite some time rereading stuff
- maybe add a
mod
infix function to do mod stuff?
39/21; points: 142, 4th place
- ????
- Lost a bunch of time checking assumptions I made by reading the problem text
-
splitIn
-
Iterable<Set<T>>.union
andintersect
27/15; points: 160, 5th place
- separated by minus signs => use posInts()
note: I want to add these helpers
- HetN for n in 2-9
- DFS
64/73; points: 65, 4th place
- input parsing took long
- Don't know why I went with Deques
- Note from 07/06/2023: can I index with ranges/progressions? if not, add that
114/108; points: 0, 15th place
- lost a lot of time trying to understand which value to return
- also
firstIndexOf
indeed existed, should have trusted myself - nim-ka has some interesting utils I should steal
- rotate left and right
note: I want to add thes helpers
- Line3D (maybe LineG?)
- maybe Bounds3D? (already have BoundsG)
- splitAt
- grid.findPoints / findSinglePoint (throws if multiple match)
- update y17d22
- =>
grid.find
- pure state loop
- update y18d18 and others (look for maps)
- allMaxByKey/value
388/320; points: 0, 20th place
32/1871; points: 69, 24th place
-
My morning routine was un acceptable. Lost multiple points in part 1 because of that
-
Also please no sleep revenge, it's not helping
-
... I have a 13 minutes warning and 3 minute warning
- at 13 is the moment I should start making sure the early part of the checklist gets done
- at 3 minutes the middle part should be FULLY DONE
-
Bound edges
-
norths/easts/souths/wests
-
Make grid iterable of BoundedGridPoints
p
-> pointv
-> valueb
-> boundsg
-> grid- mirror neighbours
- only those in the bounds, map the coordinates to BoundedGridPoints too
53/171; points: 48, 26th place
- I can't believe I choked part 2 again
- forgot the repeating part of part 1 somehow
- and an off by 1 for part 2
- update pointHelpers
- applyNTimes
- point + pointL exists, but not for 3d (maybe also make if for nd?)
176/110; points: 0, 27th place
- Missed the fact x had to start at 1
- had 2 off by one errors that cancelled each other during part 1
67/162; points: 34, 32th place
- why did I not realize I'd need to use modulo
- Sint (Safe integer)
7/17; points: 178, 25th place
- =| why is the difference between part 1 and 2 only 1 :whyy:
- make bfs and family versions that take in a list of start nodes :|
- dijkstra needs sint overloads
also:
- move points to sint
- make BoundedGridPoint + Point and all those things?
95/67; points: 40, 30h place
- JSON? JSON??? since when are we doing JSON???
154/78; points: 23, 29th place
- Made a wrong assumption =/
195/795; points: 0, 33th place
- I knew something was off with my last step but /shrug
66/354; points: 35, 32th place
- Lost a bit of time on part 1 due to not having a good vision of a solution
- Caved in after 1.5 hours for part 2 ad checked the subreddit
- add a way to reduce graphs
60/399; points: 41, 31th place
- I made an off by one typo? for part 1
- I copied the wrong fucking value for part 2
5/5; points: 192, 28th place
- WHOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO
- make sint range a collection
591/576; points: 0, 28th place
- Pfffft
266/247; points: 0, 31th place
- didn't see I had to count from the value 0, had a bunch of code just to handle counting from the start.
- while trying to find the bug, I just introduced more bugs -_-
107/503; points: 0, 35th place
68/279; points: 33, 36th place
- make grids use Bounds and Points ...
22/32; points: 148, 33th place
-
allIn
and family did a conversion to set even if the input was a set -_-
129/113; points: 0, 36th place
- spend too much time on making the updates on grid, that I had to rush starting, and apparently I stopped the recording instead of downloading my input
- could just have done a bounds.retract
32/28; points: 142, 32th place
- Whooo, some balanced based