Блог пользователя MeawCoder

Автор MeawCoder, история, 4 месяца назад, По-английски

I'm aiming to become a Pupil before the next ICPC season, and I'm looking for advice from those who have already achieved it.

  • What should I practice?
  • Which topics deserve the most focus to become pupil?
  • Is Codeforces enough, or should I use AtCoder/CSES as well?

I'd really appreciate any tips, strategies, or personal experiences. Thanks in advance!

  • Проголосовать: нравится
  • -7
  • Проголосовать: не нравится

»
4 месяца назад, скрыть # |
 
Проголосовать: нравится +6 Проголосовать: не нравится

A wise man once told me to "solve more problems and listen to twice!"

»
4 месяца назад, скрыть # |
← Rev. 2  
Проголосовать: нравится 0 Проголосовать: не нравится

Participate in on-time and virtual contests, upsolve after the contest (the most important part!) and by upsolving I mean think on problems you couldn't solve during the contest for one hour, and then read the editorial if you still couldn't get it. And also solve problems from the problemset but mostly aim for learning frequent techniques, (such as two-pointers, greedy, etc.) finding out what trick the problem needs quick, (hide tags for unsolved problems!) and getting fast in div2 A/B/C

If you can get consistent 2/3 in div2's you'll get pupil (or even specialist) pretty quick

»
4 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

I checked your submissions. I think you should solve more Div. 2 B and C problems. You've solved a lot of A and B problems, but only a small number of C problems. You should also keep challenging yourself by gradually increasing the difficulty level. Good luck!!!

»
4 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Don't solve 800 rated problems , 210 is more than enough, solve them only during contests

»
4 месяца назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Hello MeawCoder Just learn Binary Search on Answer and solve more problems on CSES (especially the Introductory and Sorting/Searching sections).You really don't need heavy graph algorithms or complex topics to reach Pupil. Just focus on speed and clean logic.And if you really want to dive into data structures, check out SQRT Decomposition — it's much easier to grasp than Segment Tree and speeds up O (N) logic to O sqrt(N) .Keep grinding, you got this :)