Company: Tvs_6aug
Difficulty: medium
Energy Efficient Drone Delivery Problem Description You are the operator of a drone delivery service, tasked with delivering packages across several cities. Each city has a designated energy supply, and each path between cities consumes a certain amount of fuel. Your goal is to plan the most fuel-efficient delivery route while maximizing the energy supply collected along the way. You can only deliver to one city at a time. Direct roads between cities are the only way to travel between them. You are not allowed to return to a city you've already visited. Some cities may be connected by multiple roads. Your objective is to start from a designated "initial city" and reach a "target city" while collecting the maximum total energy and minimizing the fuel consumed. Note: The graph is a directed acyclic graph (DAG). Input Format The first line of input contains three integers N, M, and P representing the number of cities, the number of roads, and the number of initial-target city pairs, respe