Question

Problem Description
There are N cities numbered 1 to N connected by M bi-directional roads. A concert is going to be organized in each city and in ith city it costs A[i] amount.
Every time you travel the ith road connecting BO)(O) and B[](1) city, it will cost BO(2) amount.
For each city i: 1 to N, find the minimum amount a person from city i has to pay to visit a concert in any of the city and come back to his own city.
It may not be guaranteed that each city is reachable from other city.​

Answer 1

Answer:

concert is going to be organized in each city and in ith city it ... Every time you travel the ith road connecting BO)(O) and ... Thank your teacher & they could win INR75K.