Suhana and Horror House
CodeChefOpen on judge ↗
Suhana is planning to adventure a horror house. She has the map of the horror house. It is a N x M rectangle. Entrance is (1, 1) and (N, M) is the exit. From each cell, she can go to any side-adjacent cell but the only exit is (N, M). At each cell, there is a Panic Factor PFi,j and Passing Time PTi,j. She aims to exit the with minimum sum of panic factor. But she found that there can be many
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.
Sign in to chat with the tutor and save your progress.
Sign in to start