Optimal Shopping II

CodeChefRating 3613Open on judge ↗

There are N junctions and M bidirectional roads, connecting these junctions. The junctions are numbered from 1 to N inclusive. For each road the time required to pass it is known. There's a shop in every junction. Each shop contains some of K types of goods. In i-th shop, the goods of the j-th type cost Ai,j rubles. Any item of the ith type of goods weighs for Wi grams. Initially, you are s

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