Curse of Damyaan

CodeChefRating 3238Open on judge ↗

It's Holi in Dholakpur, and Jaggu is eager to meet Raju to play with him. The map of Dholakpur can be represented as a directed acyclic graph with $N$ nodes and $M$ edges. Jaggu starts from node $1$ and want to reach node $N$ where Raju lives. But Dholakpur just got cursed by the evil monster Damyaan who can make edges disappear. Formally, the $i$-th edge has a probability $P_i$ associated with

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI