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):
Added by:  MichaĆ Czuczman 
Date:  20040707 
Time limit:  3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All 
Resource:  Swiss Olympiad in Informatics 2004 
hide comments
SangKuan:
20150817 10:44:56
do not understand this problem... 

Pagan Min:
20150623 07:43:49
AC in one go with simple knapsack!!


Shubham:
20150615 17:51:00
finally ac....tried lot with DFS but couldnt reduce Time limit...then ultimately did with Dijkstra :) 

Rishabh:
20150608 16:46:34
Last edit: 20150608 19:20:19 

ksidd:
20150531 18:55:55
first time AC in one go....:) 

Tim Wargon:
20150516 13:30:54
what a horrible way to explain a problem ! 

bazuga:
20150131 17:16:31
Any edge cases? 

krish:
20150119 14:05:13
recursive dfs.That's it:) 

CoNtRaDiCtIoN:
20150115 12:12:18
enjoyed solving it awesome problem !! 

Jens Stimpfle:
20140321 00:58:05
You can assume i!=j ==> traveltime[i][j] > 0. Which isn't explicit in the problem description, but makes the problem simpler (maybe even reduces the worst case complexity, but I'm not sure). 