From Marc Garneau C.I., Olympiads School, Don Mills Programming Gala 2019
About
:O
Cool people
ûwû my senpai: , , , , ,
My cute kouhai (some of whom also happen to be better than me :blobthumbsup:): , ,
Rivals: (I won't let you beat me >:(( ), ,
Other cool people I know in person: , , , , , , , , , , , ,
Some things:
December 4th, 2019: I reached top 100 on DMOJ leaderboards
December 10th, 2019: I (finally) got around to actually AC'ing ds5easy
December 16th, 2019: Hey look, 75th place by points
January 19th, 2020: First 40 pointer
January 20th, 2020: 400 problems solved!
January 26th, 2020: 50th place by points :O
February 5th, 2020: Yellow!
March 9th, 2020: Dynamic Tree Test FINALLY
March 15th, 2020: How do you like WQS binary search?
's template is too OP.
pragmas are double-edged swords.
Why. are LCTs nicer to implement than most traditional path queries...
When your hammer is a Link-Cut Tree, everything looks like a nail.
Access: e4d6c761fcad
:thinking: yRpAsczwUPH4oUXfK7zslZ2e+pDGIuMxfS+XqT4W7hI=