Problem I. Radio Coverage ≡
| Author: | B. Vasilyev, A. Klenin | Time limit: | 5 sec | |
| Input file: | input.txt | Memory limit: | 4 Mb | |
| Output file: | output.txt |
Statement
Radio station 'ACM Rock' is broadcasting over the circular area with center in point
(x0, y0) and radius R.
In order to increase the auditorium, it were suggested to build several relay stations.
N locations were selected as candidate sites for relay stations.
Relay station placed in i-th location will cover a circular area with center
in point (xi, yi) and radius ri,
where center lies inside the area covered by the base station,
(x0 - xi)2 +
(y0 - yi)2 ≤ R2.
Your task is to select a subset of sites for relay stations so that:
- the covered areas for relays do not intersect (but may touch) one another,
- the total area covered by base station and all relays is maximum possible.
Input file format
Input file contains integer number N followed by real numbers x0 y0 R, followed by N triples of real numbers xi yi ri.Output file format
Output file should contain a single real number — the maximal coverage area with the absolute error less than 10−2.Constraints
1 ≤ N ≤ 10, 0 ≤ xi, yi, x0, y0 ≤ 1000, 1 ≤ ri ≤ R ≤ 1000.Sample tests
| No. | Input file (input.txt) |
Output file (output.txt) |
|---|---|---|
| 1 |
|
|