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 one-way, 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 count-down timer is started. When the timer stops we count the number of mice out of the maze.


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.


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 count-down 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 one-way, 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.


The output consists of a single line with the number of mice that reached the exit cell $E$ in at most $T$ time units.


1 2 1
1 3 1
2 1 1
2 4 1
3 1 1
3 4 1
4 2 1
4 3 1


hide comments
aqua: 2015-06-19 01:54:05

simple bruteforce !!

Kunwar Sachin Singh: 2015-05-26 08:52:59

can be solved by using dijkstra

GAURAV CHANDEL: 2015-04-14 15:33:43

good problem to practice floyd warshall algorithm....

sai krishna: 2015-03-07 14:53:12

simpe floyd warshall

Rishav Jain: 2015-02-21 19:13:42

images are nt opening:(
at most wht time & which cell r exit cell?

(Francky) => Image now visible. Please use full words in comments.

Last edit: 2015-02-21 20:58:00
Prasanth: 2015-02-01 06:01:24

Images links in the input description are broken. Please update it

S: 2015-01-11 15:08:06

got it accepted in first Attempt ..

Sudarshan K: 2014-08-29 16:06:40

Edge pairs are unique. Between a and b there exists at most one edge. Eveyrthing fits in an int.

californiagurl: 2014-05-27 16:48:41

is there more than one path from a to b , with different times for escape?

Smithers: 2012-11-04 17:46:54

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

For any given cells a, b, there is at most one passage from a to b. (There may or may not also be a passage from b to a.)

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