import java.io.*;
class code {
public static void main(String[] args) throws Exception {
String input = null;
// read input from stdin
input = new BufferedReader(new InputStreamReader(System.in)).readLine();
// write output to stdin
System.out.println(input);
}
}
complete the above code for the given problem statement
Casa OMS
Base Problem Statement
Adhitya, a skilled software engineer, has been assigned a task to add a new feature to the Order Management System (OMS). Your role as a mentor is to help Adhitya complete this feature within the given deadline. The new feature, called "Optimal Delivery Recommendations," aims to enhance the OMS by suggesting the best delivery options for orders.
Background:
The OMS stores information about warehouses, inventory, and the distances between them.
It interacts with a third-party software for Shipment Information.
A Shipment can be between a warehouse and a customer or within two warehouses.
In the initial version (v1.0.0), shipping costs are determined by distance (1 km = 1 rupee), and it takes 1 day for the shipment company to cover 10 km (rounding up to the nearest day -> 13 km will be rounded as 2 days (ceil value)). Assume that only one shipment can be completed per day.
Customers can purchase up to two products in a single order.
New Feature:
The Optimal Delivery Recommendations feature suggests two delivery options: Fastest and Cheapest.
The OMS can fulfill orders from multiple warehouses and supports both parallel and sequential shipments.
In Fastest Recommendation, if multiple recommendations have the same delivery time, the cheapest option will be prioritized.
In Cheapest Recommendation, if multiple recommendations have the same cost, the fastest delivery option will be preferred.
If the product is not deliverable(the warehouse may have no products), return "Product Not Available".
Example:
If a customer buys a shirt and pants, the OMS can fulfill the order from multiple warehouses if necessary.
Input Explanation:
Each test case begins with an integer N denoting the number of warehouses. The following N lines contain warehouse information Wi followed by products P1, P2, P3, etc. Each warehouse can have any number of products where the product name serves as a unique identifier (case sensitive and product name format is alphanumeric).
The next N lines consist of an NxN matrix representing the distance between each pair of warehouses. The distance from Wi to Wj is the same as from Wj to Wi. Each line represents distances from Wi to all other warehouses (W1, W2, W3, ..., Wn). The distance from Wi to itself (Wi) is always zero (0 km).
Following the matrix, the next line contains two integers P1 and P2, each representing a product name (product identifier).
The last line contains N integers representing the distance between the customer's location and each corresponding warehouse.
Format
N
W1 P1 P2 P3
W2 P2 P1
.
.
Wn P3 P1 P2 P4
W1 W2 ... Wn
W1 W2 ... Wn
.
.
.
W1 W2 ... Wn
P1 P2
DW1 DW2 ... DWn
Output Explanation:
The output will consist of two lines of recommendations. The first line represents the fastest option, and the second line represents the cheapest option.
Each line contains three space-separated strings.
- The first string represents the mode ('Fastest' or 'Cheapest').
- The second string represents the number of days (Xi) required to fulfill the entire order.
- The third string represents the total cost (Yi) to fulfill the entire order.
Format:
Fastest X1 Y1
Cheapest X2 Y2
