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.
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 i-th 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.
For each test case your program should print on one line the total amount of tolls followed by the actual travelling time.
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|
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Resource:||Swiss Olympiad in Informatics 2004|
do not understand this problem...
AC in one go with simple knapsack!!
finally ac....tried lot with DFS but couldnt reduce Time limit...then ultimately did with Dijkstra :)
Last edit: 2015-06-08 19:20:19
first time AC in one go....:)
what a horrible way to explain a problem !
Any edge cases?
recursive dfs.That's it:)
enjoyed solving it awesome problem !!
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).