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

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

How can the last contest's C problem which was mixing water can be solved using binary search or something like that.

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

»
4 года назад, # |
  Проголосовать: нравится +3 Проголосовать: не нравится

Just keep solve problems with some positive delta above your rating. When you find problems which need something that you don't know then you should learnt it.

  • »
    »
    4 года назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    This. 90% of Div2C can be solved knowing just binary search and prefix sums.

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

CP-Algorithms is all you need.

1.Div2 c: complete algebra part and string part

2.Div2 d: complete graph (upto bellman ford) and segtrees

You can pratice more problem from A2OJ ladder.

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

Learn mathematical topics like Number Theory, Combinatorics.
Speaking of DSA, learn Dynamic Programming, you can find many playlists out there and practice a lot... DP is one of the things which require a lot of practice. I am still trying to improve my DP.
Also you may learn Graph Theory slowly, it's a vast topic and will require a lot of time, but starting will allow you to do even Div2D & Educational D problems too...those graph questions which are rated under 1800 and tagged as dfs and similar can be done using basic concepts of graph theory. But I insist on doing mathematics part, it helps a lot.
Also you need to practice a lot on a topic you've just studied.
I'm sharing some of the playlists/links, I've followed if it helps you.
Number Theory(even recommended by Errichto)
Graph Theory 1
Graph Theory 2
DP
Youtube channels of Errichto, kazama460 and striver_79 are awesome. You can follow their channels for amazing learning experience.
For practice of problems of a topic you can simply filter in CF problemset or go to A2OJ.

UPD : Yes, CP-Algorithms is the best place out there if you prefer reading than watching.

  • »
    »
    4 года назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    I think referring Tushar Roy for DP does not makes sense, he starts the approach by writing the recurrence, without explaining the thought process behind it, which will not help a beginner to learn DP.

    • »
      »
      »
      4 года назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      Yeah, I agree too. But I didn't find any complete DP playlist other than his, Both you and kazama460 were/are still updating your playlists(P.S.- I follow them too). But I just gave the link of it because I thought that it was complete, sorry if I'm wrong.
      Btw, love your video editorials, in some problems those really helps a lot to understand, because the official editorial statements are not properly understandable sometimes. Also loved your Fenwick Tree tutorial.

  • »
    »
    4 года назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    Thanks :) What actually do u mean by mathematical part?

    • »
      »
      »
      4 года назад, # ^ |
        Проголосовать: нравится 0 Проголосовать: не нравится

      Number Theory, Algebra, Combinatorics, etc.
      Just go to CP-ALgorithms and try to cover the topics under Algebra and Combinatorics.
      You'll understand what I'm telling.

»
4 года назад, # |
Rev. 4   Проголосовать: нравится 0 Проголосовать: не нравится
  1. Solve problem of (your rating + (100 to 200)) rating. Speaking of algorithms.
  2. Practice lot of DP problems
  3. Learn Basic Graph Theory and practice problems on these topics (BFS, DFS).
  4. Learn Binary Search and Practice problems on these topics.