FISHER  Fishmonger
A fishmonger wants to bring his goods from the port to the market. On his route he has to traverse an area with many tiny city states. Of course he has to pay a toll at each border.
Because he is a good business man, he wants to choose the route in such a way that he has to pay as little money for tolls as possible. On the other hand, he has to be at the market within a certain time, otherwise his fish start to smell.
Input
The first line contains the number of states n and available time t. The first state is the port, the last state is the market. After this line there are n lines with n numbers each, specifying for each state the travel time to the ith state. This table is terminated with an empty line. The table of the tolls follows in the same format.
n is at least 3 and at most 50. The time available is less than 1000. All numbers are integers.
There are many test cases separated by an empty line. Input terminates with number of states and time equal 0 0.
Output
For each test case your program should print on one line the total amount of tolls followed by the actual travelling time.
Example
Sample input: 4 7 0 5 2 3 5 0 2 3 3 1 0 2 3 3 2 0 0 2 2 7 2 0 1 2 2 2 0 5 7 2 5 0 0 0 Sample output: 6 6
This corresponds to the following situation, the connections are labeled with (time, toll):
hide comments
amulyagaur:
20171219 06:02:51
submit the same code for FPOLICE also and get 2 ACs within few seconds :) 

shubham808:
20170715 14:05:14
AC in 1 go !! *) 

youssef20:
20170416 12:05:48
:) \n


cake_is_a_lie:
20170307 16:55:03
The problem statement should specify that travel time is always positive; it makes sense, but if some states had teleporters, my solution  and probably many others  wouldn't work.


nurlansofiyev:
20161020 20:43:43
First matrix is tolls matrix second matrix is time matrix ! 

Ahmed Hussein:
20160818 17:26:31
50 * 50 * 1000 iterative will pass 

Shivang Badola:
20160701 10:16:27
Take care that you read TIME first then TOLLS..cost me many WA.


PARTH SHARMA:
20160623 14:45:27
dp in time :)) 

aspro:
20160516 07:00:31
TLE with recursion(DFS)...solved with DP(knapsack)...


epsilon:
20160126 07:15:53
can someone please explain the input format Last edit: 20160126 07:16:14 
Added by:  MichaĆ Czuczman 
Date:  20040707 
Time limit:  3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  Swiss Olympiad in Informatics 2004 