Scribd
Upload
155 views2 pages

ANIEI 2020 Programming Contest Problem A

The document describes a problem where the goal is to find the maximum number of sensors that can be activated in a rectangular field while still allowing a robot to travel across the field undetected. The field contains sensors located at (x,y) coordinates with detection radii. The robot must start at the bottom and end at the top of the field without passing within range of any active sensors. The problem is to find the largest number of sensors that can be activated and still permit a path for the robot. Input consists of the number of sensors and their x,y,r coordinates. Output is the maximum number of sensors that can be activated.

Uploaded by

Abinadad Morales
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
155 views2 pages

ANIEI 2020 Programming Contest Problem A

The document describes a problem where the goal is to find the maximum number of sensors that can be activated in a rectangular field while still allowing a robot to travel across the field undetected. The field contains sensors located at (x,y) coordinates with detection radii. The robot must start at the bottom and end at the top of the field without passing within range of any active sensors. The problem is to find the largest number of sensors that can be activated and still permit a path for the robot. Input consists of the number of sensors and their x,y,r coordinates. Output is the maximum number of sensors that can be activated.

Uploaded by

Abinadad Morales
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Concurso de programación ANIEI 2020 1

Problem A
UnDetected
The Department of Defense has been designing autonomous robots that can infiltrate war zones and
other hostile places in order to carry out missions. Now they want to test their latest design, the
Penetrator1700, and they’ve hired you to help design the test environment.
The test environment is a rectangular field with some sensors placed within the field. Each sensor has
a certain radius defining the region within which it can detect a robot. You want to design the field to
have as many sensors as possible while still permitting a route across the field that avoids detection.
The field is a region of the coordinate plane defined by 0 ≤ x ≤ 200 and 0 ≤ y ≤ 300. The robot
can be modeled by a point that must remain on the field at all times. It starts at the bottom of the
field (y = 0) and must end at the top of the field (y = 300), and must not pass within range of any
sensor. There are N sensor locations given by triples (x, y, r) of integers, where each (x, y) is a point
on the field, and r is its radius of detection. The implied sensor circles may overlap, but will never
be tangent with each other nor with the boundary of the field. All sensors are initially inactive. You
must find the largest value of k such that if sensors 1, 2, 3, ..., k are activated there is a path for the
robot across the field, but no path if the (k + 1)st sensor is also activated. It is guaranteed that there
is no path if all N sensors are activated.

Input
Input begins with a positive integer N ≤ 200. Each of the next N lines has three space-separated
integers, representing x, y, r for a sensor, where r ≤ 300. All sensors lie at different (x, y) positions.
The first three sample inputs below correspond to the figure shown.

Output
Output a single integer (which may be 0) giving the largest k as described above.
Concurso de programación ANIEI 2020 2

Examples
Input Output
6 2
36 228 58 3
164 224 58 4
88 170 42
0
93 105 42
167 85 58
28 44 58
6
36 228 58
28 44 58
164 224 58
88 170 42
93 105 42
167 85 58
6
28 44 58
36 228 58
88 170 42
93 105 42
164 224 58
167 85 58
3
100 150 101
30 30 10
170 30 100

You might also like