Scribd Logo
Upload

Welcome to Scribd!

  • SPOJ CATM Editorial

    Uploaded by

    Medo N
    113 views1 page
    The document discusses using breadth-first search (BFS) to solve a graph theory problem where a mouse tries to escape from two cats on a grid. It explains that the mouse can escape to a cell if it reaches the cell in fewer steps than the minimum number of steps either cat would take to reach that cell. The solution performs three BFS traversals from the mouse and two cats to get all distances to grid corners, and checks if the mouse can reach any corner in fewer steps than the cats.

    Original Description:

    Original Title

    SPOJ-CATM-Editorial.txt

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document discusses using breadth-first search (BFS) to solve a graph theory problem where a mouse tries to escape from two cats on a grid. It explains that the mouse can escape to a cell if it reaches the cell in fewer steps than the minimum number of steps either cat would take to reach that cell. The solution performs three BFS traversals from the mouse and two cats to get all distances to grid corners, and checks if the mouse can reach any corner in fewer steps than the cats.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    113 views1 page

    SPOJ CATM Editorial

    Uploaded by

    Medo N
    The document discusses using breadth-first search (BFS) to solve a graph theory problem where a mouse tries to escape from two cats on a grid. It explains that the mouse can escape to a cell if it reaches the cell in fewer steps than the minimum number of steps either cat would take to reach that cell. The solution performs three BFS traversals from the mouse and two cats to get all distances to grid corners, and checks if the mouse can reach any corner in fewer steps than the cats.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Topic: Graph Theory

    Algorithm: BFS

    Suppose the mouse will escape from cell (i,j) at time T (T starts from 0), then
    this is only possible if none of the cats can reach this cell before than or equal
    to T, because otherwise, the cat would eat the mouse. Since we are always trying to
    get there as fast as possible, T here is equal to the minimum number of steps.

    Using this idea, the idea is getting all distances from the mouse, and the two cats
    to every grid corner, and checking if the mouse can reach it in strictly less
    number of steps.

    Since the graph is unweighted, 3 BFS's are enough.

    Code for reference :


    https://github.com/MedoN11/CompetitiveProgramming/blob/master/SPOJ/CATM.cpp

    Done by : Medo Nasser

    You might also like