Problem Statement   You are interested in purchasing items from a number of stores in a local market. The market is composed of N stores numbered from 0 to N1. The stores with numbers from 0 to M1 are interesting to you and all the other stores are not interesting. Some pairs of stores are connected by roads.
You are given a String[] interestingStores which contains M elements and describes the interesting stores. The ith element corresponds to store i and is formatted "OPEN CLOSE DURATION" (quotes for clarity), where OPEN is the opening time (in seconds), CLOSE is the closing time (in seconds) and DURATION is the time (in seconds) required to make a purchase in this store. You can initiate a purchase from a store at any time T between OPEN and CLOSE, inclusive. In order to do so, you need to arrive to the store at time T (or earlier). The purchase will be finalized at time T + DURATION and you need to stay at the store for the entire duration of your purchase. Note that it is possible for a purchase to end when the store is already closed. You cannot make multiple purchases in the same store.
The roads are given by the String[] roads. Each element of roads describes a single bidirectional road and is formatted "A B LENGTH" (quotes for clarity). Here A and B are the numbers of stores connected by the road and LENGTH is the time (in seconds) required to move from A to B (or from B to A) using this road.
Your start at time 0 at the location of store N1. Return the maximum number of purchases in interesting stores that you can make.   Definition   Class:  TravellingPurchasingMan  Method:  maxStores  Parameters:  int, String[], String[]  Returns:  int  Method signature:  int maxStores(int N, String[] interestingStores, String[] roads)  (be sure your method is public) 
    Notes    You are allowed to wait for any amount of time at any location.   Constraints    N will be between 1 and 50, inclusive.    roads will contain between 1 and 50 elements, inclusive.    Each element of roads will be formatted "A B LENGTH" (quotes for clarity), where A, B and LENGTH are integers with no unnecessary leading zeros.    In each road, A and B will each be between 0 and N1, inclusive.    In each road, A and B will be distinct.    In each road, LENGTH will be between 1 and 604,800, inclusive.    There will exist at most one road between each pair of stores.    interestingStores will contain between 1 and min{16, N} elements, inclusive,    Each element of interestingStores will be formatted "OPEN CLOSE DURATION" (quotes for clarity), where OPEN, CLOSE and DURATION are integers with no unnecessary leading zeros.    In each store, OPEN will be between 0 and 604,800, inclusive.    In each store, CLOSE will be between OPEN+1 and 604,800, inclusive.    In each store, DURATION will be between 1 and 604,800, inclusive.   Examples  0)    3  {"1 10 10" , "1 55 31", "10 50 100" }  {"1 2 10"} 
 Returns: 1  It is not possible to make more than one purchase:
 If you decide to make the purchase at store 2: You need to wait 10 seconds until it opens. Then wait until time = 110 seconds for the purchase to finish. At 110 seconds, all the other stores will be closed.
 If you instead decide to make the purchase at store 1: You first need travel through the road and arrive store 1 at time = 10. The purchase finishes at time = 41. After you travel back to store 2, the time will be 51 seconds and store 2 will be closed.
 There is no way to reach store 0 when store 2 is the starting point.


 1)    3  {"1 10 10" , "1 55 30", "10 50 100" }  {"1 2 10"} 
 Returns: 2  This time we can travel to store 1, make the purchase and return to store 2 exactly at time = 50 to make two purchases in total.


 2)    5  {"0 1000 17"}  {"2 3 400", "4 1 500", "4 3 300", "1 0 700", "0 2 400"} 
 Returns: 0  It is not possible to reach store 0 before it closes.



This problem statement is the exclusive and proprietary property of TopCoder, Inc. Any unauthorized use or reproduction of this information without the prior written consent of TopCoder, Inc. is strictly prohibited. (c)2010, TopCoder, Inc. All rights reserved.
