Codeforcer's blog

Djisktra is just too slick
By Codeforcer, history, 6 weeks ago, In English

I was going through multiple blogs on Djikstra recently, viz Graph Modelling, K path skip and Eppstein algorithm. I came across many interesting problems which were just not possible for me to solve without prior knowledge of these concepts. I am still struggling to do these problems (at a rate of 1 per day). Came across some ingenious yet elegant problems as well. I would love to know more on the type of patterns that Djikstra can solve and if you guys know any cool tricks or problems like the one above.

Thanks!

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

»
6 weeks ago, # |
  Vote: I like it +5 Vote: I do not like it

2023B - Skipping

→ Reply
»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

I came across many interesting problems which were just not possible for me to solve without prior knowledge of these concepts.

Try solve 1753D - The Beach. This problem only requires Dijkstra and nothing else.

→ Reply