Black & White II

CodeChefOpen on judge ↗

You are given an undirected weighted connected graph having *n* nodes and *m* edges. Every node can either be white coloured or black coloured. The weight of an edge denotes the **time taken to travel through that edge**. Jack is initially at node 1. He wants to reach at node *n* in the minimum time possible. But Jack has to follow the following constraints: - At any node, if the colour of th

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