GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
23 views

A group of war prisoners are trying to escape from a prison. They have thoroughly planned teh escape from the prison itself, and after that they hope to find shelter in a nearby village. However, the village (marked as $B$, see picture below) and the prison (marked as $A$) are separated by a canyon which is also guarded by soldiers (marked as $S$). These soldiers sit in their pickets and rarely walk; the range of view of each soldier is limited to exactly 100 meters. Thus, depending on the locations of soldiers, it may be possible to pass the canyon safely, keeping the distance to the closest soldier strictly larger than 100 meters from any moment. The situation is depicted in the following picture, where the circles around $S$ indicate the range of view.

Provide an algorithm to determine if the prisoners  can pass the canyon unnoticed, given the width and the length of a canyon and teh coordinated of every soldier in the canyon, and assuming that soldiers do not change their locations ($Hint$: Model this as a graph, with soldiers represented by the vertices.)

asked in Others by Veteran (77.2k points)   | 23 views

Please log in or register to answer this question.



Top Users May 2017
  1. akash.dinkar12

    3154 Points

  2. pawan kumarln

    1636 Points

  3. sh!va

    1600 Points

  4. Arjun

    1360 Points

  5. Bikram

    1322 Points

  6. Devshree Dubey

    1262 Points

  7. Debashish Deka

    1132 Points

  8. Angkit

    1044 Points

  9. LeenSharma

    900 Points

  10. srestha

    710 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 May 22 - 28
  1. Bikram

    408 Points

  2. pawan kumarln

    262 Points

  3. Ahwan

    236 Points

  4. Arnab Bhadra

    234 Points

  5. LeenSharma

    138 Points


22,772 questions
29,098 answers
65,132 comments
27,639 users