MICEMAZE  Mice and Maze
A set of laboratory mice is being trained to escape a maze. The maze is made up of cells, and each cell is connected to some other cells. However, there are obstacles in the passage between cells and therefore there is a time penalty to overcome the passage Also, some passages allow mice to go oneway, but not the other way round.
Suppose that all mice are now trained and, when placed in an arbitrary cell in the maze, take a path that leads them to the exit cell in minimum time.
We are going to conduct the following experiment: a mouse is placed in each cell of the maze and a countdown timer is started. When the timer stops we count the number of mice out of the maze.
Problem
Write a program that, given a description of the maze and the time limit, predicts the number of mice that will exit the maze. Assume that there are no bottlenecks is the maze, i.e. that all cells have room for an arbitrary number of mice.
Input
The maze cells are numbered $1, 2, \ldots, N$, where $N$ is the total number of cells. You can assume that $N \le 100$.
The first three input lines contain $N$, the number of cells in the maze, $E$, the number of the exit cell, and the starting value $T$ for the countdown timer (in some arbitrary time unit).
The fourth line contains the number $M$ of connections in the maze, and is followed by $M$ lines, each specifying a connection with three integer numbers: two cell numbers $a$ and $b$ (in the range $1, \ldots, N$) and the number of time units it takes to travel from $a$ to $b$.
Notice that each connection is oneway, i.e., the mice can't travel from $b$ to $a$ unless there is another line specifying that passage. Notice also that the time required to travel in each direction might be different.
Output
The output consists of a single line with the number of mice that reached the exit cell $E$ in at most $T$ time units.
Example
Input: 4 2 1 8 1 2 1 1 3 1 2 1 1 2 4 1 3 1 1 3 4 1 4 2 1 4 3 1 Output: 3
hide comments
GAURAV CHANDEL:
20150414 15:33:43
good problem to practice floyd warshall algorithm.... 

sai krishna:
20150307 14:53:12
simpe floyd warshall 

Rishav Jain:
20150221 19:13:42
images are nt opening:(


Prasanth:
20150201 06:01:24
Images links in the input description are broken. Please update it 

S:
20150111 15:08:06
got it accepted in first Attempt .. 

Sudarshan K:
20140829 16:06:40
Edge pairs are unique. Between a and b there exists at most one edge. Eveyrthing fits in an int. 

californiagurl:
20140527 16:48:41
is there more than one path from a to b , with different times for escape? 

Smithers:
20121104 17:46:54
Notes: It can safely be assumed that all times fit into a 32bit signed integer and that the time to travel from one cell to another will always be strictly positive.


Anmol:
20121004 18:31:46
edge pairs are'nt unique got AC after realising that!!

Added by:  overwise 
Date:  20071004 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ACM ICPC  SWERC 2001 