This user has shared some information

S t u p i d i t y i s f a t a l

ti ag bi c mo np

30063bc53daed3b92d025932615ca4888ce5ac817eb97e3bf3512120712abc2a

cool people bruce kylin Tinyfold phoenix Myself? JamesJiao

Log

a wise kylin once said (and a not so wise JamesJiao stole from phoenix)

dp: yay, passed sample, 99.9% chance it is correct... wait what it's TLE?! WHY DOES N=7500 WHEN THE INTENDED SOLUTION IS O(N^2)?!

greedy: AAAAHH WHY IS IT WRONG I TESTED 1000000 DIFFERENT TEST CASES

data structures: wait what it uses 1.6 GB?! and... tle...

string: what- why does it get wrong for the last test case? oh, hash collision

recursion: HOW DO I DEBUG THIS?!

math: OK, i just did all this math, so the answer for (n, m) is 1.5(n!)choosem+2^m-506c^2-5c+nm-54n+424289 where c is nn!*(n+2m)choose(n-m). time to test sample... WRONG?!

graph: oof implementing heavy light decomposition, centroid decomposition, and weird dp on the block cut tree of biconnected components

divide & conquer: binary search! oh wait it's not monotone. it never is.........

game theory: AHH IT'S STILL WRONG WHY IS THIS NOT THE BEST STRATEGY?!

geometry: AHHH OFF BY 0.00004289