← All problemsSign in

Vinish and Asgard Queries

Vinish is the new king of Asgard. Asgard is a connected kingdom of N cities with each pair of cities having exactly one path between them.Let the traffic present in each city i be TF[i].The cost of a path between two cities is determined by the sum of traffics of the individual cities present along the path. Vamsi wanted to test Vinish by asking him a few questions about Asgard. There are two ty

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

Sign in to chat with the tutor and save your progress.

Sign in to start