In the event of technical difficulties with Szkopuł, please contact us via email at [email protected].
If you are familiar with IRC chat, the support team is also reachable on PIRC network (
#szkopul channel. If you are not, just use email.
Please do not ask us things like "how to solve task XYZ?".
Please remember that the support team has to sleep sometimes or go to work in real life.
Let us consider a diagram describing a net of municipal transportation, for example a bus-net, tram-net or underground-net etc. Vertices of the diagram (numbered ), correspond to stations, edges , (where ) denote that there is a direct connections from the station to the station (). Transportation lines are numbered . The transportation line no. is defined as a series of stations , on which vehicles of the line no. stop, and durations of traveling between stations - is the time necessary to get from the station to the station , or vice versa (i.e. from the station to the station ); is the time necessary to get from the station to , etc. All the stations of a line are different (i.e. implies ). In the transportation line no. vehicles run with certain frequency , where is a number from the set . The vehicles in the transportation line no. start from the station at each hour of the day and night, , (), and than according to the frequency of the line i.e. at etc. ( means minutes after hour ). Vehicles of the line run in two directions: from the station to , and from the station to . The hours of departure of the vehicles of the transportation line no. from the station are the same as from the station .
In such a transportation net we want to make a trip from the start station to the finish station . We assume that the trip is possible and will take no longer than 24 hours. During the trip one can change transportation lines as many times as he/she wants to. Say, the time of a change is equal to 0, however, while changing the line we have to take under consideration the time of waiting for the vehicle that we want to get into. Our purpose is to get from the start station , to the finish station , as quick as it is possible.
On the picture below you can see a scheme of the transportation net with 6 stations and two lines: no. 1 and no. 2. Vehicles of the line no. 1 go between stations 1, 3, 4 and 6, vehicles of the line no. 2 go between stations 2, 4, 3 and 5. The frequencies with which the vehicles run are equal to and respectively. The durations of travel between stations are written next to the edges of the net; they are given indices 1 and 2 for particular lines.
Let us assume, that at 23:30 we stay on the station no. 5 and we want to get to the station no. 6. It is necessary to wait 10 minutes and then (at 23:40) one can leave using line no. 2. There are two options of our trip. The first option is to get to the station no. 3 at 23:51, wait 3 minutes, change to the line no. 1 at 23:54 and get to the station 6 at 0:16 (the next day). The second option is to take the line no. 2 and get to the station no. 4 at 0:8 a.m., we wait 13 minutes and at 0:21 a.m. we take the vehicle of the line no. 1 and we get to the station no. 6 at 0:31. Thus the earliest time we can get to the station no. 6 is at 0:16.
Write a program which:
In the first line of the standard input there are written six integers, separated by single spaces:
Your program should write in the only line of the standard output two integers, separated by a single space: the hour of the earliest possible arrival to the finish station () and the minute of the earliest possible arrival to the finish station ().
For the input data:
6 2 5 6 23 30 4 15 1 3 4 6 9 12 10 4 20 5 3 4 2 11 17 11
the correct result is:
Task author: Zbigniew Czech.