itsraajjjuuuu's blog

By itsraajjjuuuu, history, 13 months ago, In English

I want to be able to solve most of graph/tree problems below 2000 rating as soon as possible. How should I practice and What should I practice? I know basic DSU/bfs/dfs/dijikstra but almost no idea about advance concepts (Tarzan/Euler/other algorithms) I am able to solve 1500-1600 rated Graph ques most of the time but for 1700+ rating problems probablity of me solving question is almost zero. I want to know what is actually this wall and how can I cross it ?Any tips for meee ;>

  • Vote: I like it
  • +2
  • Vote: I do not like it

»
13 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by itsraajjjuuuu (previous revision, new revision, compare).

»
13 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

for resources go to usaco but other than that there is no real way to solve problems faster than to rot your brain for hours looking at the screen and guessing randomly what the f the solution for this could be, until your rotten brain can start picking up patterns and tells you ah its dsu, prims, dfs, tree flattening and so on just by looking at problem and constraints