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.
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
AC in ONE GO!
Didn't use dijkstra. Reversed connections and counted cells that can be reached starting from exit cell in time less then T. If I could reach cell in less time than already did earlier added cell to deque and changed time[cell]. Just bfs with a little additions.Last edit: 2017-03-02 12:23:39
Easy one with dijkstra's :-)
Flloyd Warshall works well here.
Nice dijkstra problem :D
any one please help me about constraints..??
No one ever told me that I can't start a sized array from 1. Costed me 8 runtime error... :( ;(Last edit: 2016-07-06 09:10:42
need to clear the vector first... cost me 4 wa!!!
If you are using vector then please
Nice dijkstra problem for beginners