Yknow,Even though my past three contests have been fairly lucky, getting to blue (the real blue as opposed to the “fake” light blue according to strongeric) still feels quite fulfilling even though it is just a number stored on a database somewhere subject to being wiped in seconds by a solar flare but I digress. I supposed ill tell a somehwat interesting story. So actually when i first started cf, that was after i had learned some dsa (from usaco guide orz orz orz benqi). So thus doing so, i had completed all the modules from bronze-gold and new all the data structures to a fairly high extent and thus i thought i would be at least like 1500 (my ego thought surely i would be higher than 1500) rating right? Nope, wrong wrong wrong. On my first contest i solved a big fat 1 problem correctly/ This placed me at 418 which isn’t very good if i do say so myself. I then waited another like 6 months before running another contest at which point i was getting roughly 10000 place and garnering roughly 1000 perf. Not great isn’t it? Eventually i somehow picked up some knowledge and started getting slightly better places and this summer i had somewhat of a lockin and kinda started getting 1200+ elo then 1400ish and now my past three contests have all been blue perf which is really cool and thus made me a blue coder. ↵
↵
Some advice i have for people <light blue (or cyan as per greateric):↵
-Solving tons of problems does not necessarily make you better. I solved like 30 800 problems over the course of 3 hours and i can confidently tell you i learned almost nothing (if you are around 800 elo you should solve 800 level problems though). Solving tons of problems close to or slightly higher than your rating makes you better (usually).↵
-You do not need to know (insert niche data structure) to make it to cyan or blue. I don’t think i used binary search more than 5 times in contest on cf. I’ve actually seen a usage for a segtree that wouldve solved a problem a couple times so maybe fenwick tree is worth learning but even then idk. You could probably get by on maybe prefix sums,binary search, and some tree stuff and make it to candidate master. Overall I would say if you haven’t seen a data structure used more than once in practicing around your level, you probably don’t need to know how to use it.↵
-You learn more from problems you cannot solve than ones you do. Someone signifigantly better at cp than me said you should aim for roughly 30-40% solve rate in practice.↵
-Talking about cp does not make you better at cp. I learned this one the hard way.↵
-Making blogs about cp does not make you better at cp. I am learning this one the hard way.↵
-Doing cp makes you better at cp. I will learn this the hard way.↵
↵
↵
↵
Also this is the last time i will be the same color as highest person on my friends list so yayy↵
↵
Also to cat, euc, fate, bit, atri. Mitp, I’m pretty sure i was ahead of you at least one point in the last contest so ggs? Also i think i beat everyone here except fate in a contest so ggs again?↵
↵
/predownloaded/5f/cb/5fcb57c0d20da19bda01ff32ef631a75343627b7.png↵
↵
Also thx to the usaco server (i hope to join gf server soon pls let me in im only like 248 away) for giving me tons of good and bad advice and being somewhat of a reason why i continued with this nonsense.↵
↵
Sorry my bad english, i hope to improve it soon.↵
↵
↵
↵
Some advice i have for people <light blue (or cyan as per greateric):↵
-Solving tons of problems does not necessarily make you better. I solved like 30 800 problems over the course of 3 hours and i can confidently tell you i learned almost nothing (if you are around 800 elo you should solve 800 level problems though). Solving tons of problems close to or slightly higher than your rating makes you better (usually).↵
-You do not need to know (insert niche data structure) to make it to cyan or blue. I don’t think i used binary search more than 5 times in contest on cf. I’ve actually seen a usage for a segtree that wouldve solved a problem a couple times so maybe fenwick tree is worth learning but even then idk. You could probably get by on maybe prefix sums,binary search, and some tree stuff and make it to candidate master. Overall I would say if you haven’t seen a data structure used more than once in practicing around your level, you probably don’t need to know how to use it.↵
-You learn more from problems you cannot solve than ones you do. Someone signifigantly better at cp than me said you should aim for roughly 30-40% solve rate in practice.↵
-Talking about cp does not make you better at cp. I learned this one the hard way.↵
-Making blogs about cp does not make you better at cp. I am learning this one the hard way.↵
-Doing cp makes you better at cp. I will learn this the hard way.↵
↵
↵
↵
Also this is the last time i will be the same color as highest person on my friends list so yayy↵
↵
Also to cat, euc, fate, bit, atri. Mitp, I’m pretty sure i was ahead of you at least one point in the last contest so ggs? Also i think i beat everyone here except fate in a contest so ggs again?↵
↵
Also thx to the usaco server (i hope to join gf server soon pls let me in im only like 248 away) for giving me tons of good and bad advice and being somewhat of a reason why i continued with this nonsense.↵
↵
Sorry my bad english, i hope to improve it soon.↵
↵
↵
