shunfurh 于 2017.09.03 00:07 提问

Ghost Busters

The famous Ghost Busters team has decided to upgrade their Ectomobile (aka Ecto-1) with a powerful proton gun and an advanced targeting system. Egon has designed and built all the hardware which consists of ectoplasmic scanner and a proton gun that has two degrees of freedom and can automatically rotate and fire in a 90 degrees trihedral angle. You have been hired to write a prototype for the targeting software.

Ghosts are detected by ectoplasmic scanner and are represented as floating spheres. The coordinates of their centers and radii are delivered from the ectoplasmic scanner to the targeting software. The coordinate system is aligned in such a way, that the proton gun fires from the point (0, 0, 0) anywhere into X >= 0, Y >= 0, Z >= 0 trihedral angle. The gun fires a proton ray in a straight line and is so powerful, that even a touch of its ray is enough to kill a ghost. The ray of the proton gun is able to kill a virtually unlimited number of ghosts on its way.

For the first prototype for the targeting software, you are asked to write a program that determines the maximal number of ghosts that can be killed with a single shot of the proton gun.

Input

On the first line of the input file there is a single integer number N (0 <= N <= 100) - the number of ghosts detected by the ectoplasmic scanner of Ecto-1. The following N lines describe detected ghosts - one ghost per line. The description of ith ghost (ghosts are numbered from 1 to N) consists of 4 integer numbers Xi, Yi, Zi, and Ri, separated by spaces. Xi, Yi, Zi (1 <= Xi, Yi, Zi <= 10000) are the coordinates of the ghost's center, and Ri (1 <= Ri <= min(Xi, Yi, Zi)) is the ghost's radius. Because ghosts are ectoplasmic, they can be arbitrarily placed in respect to each others. They can intersect, fit inside each other, coincide with each other, etc.

Process to the end of file.

Output

On the first line of the output file write a single integer number - the maximal number of ghosts that can be killed with a single shot of the proton gun. On the second line of the output file write the identifying numbers of the ghosts to be killed in an arbitrary order separated by spaces. If there are multiple ways to kill this number of ghosts then write any one.

Sample Input

2
1200 1200 3900 300
160 160 820 60
13
1200 1200 3900 300
160 160 820 60
100 10 10 10
10 100 10 10
10 10 100 10
10 10 10 10
50 50 50 10
100 100 75 20
100 75 100 20
75 100 100 20
3000 4000 7000 2600
100 1000 1000 50
1000 100 1000 100

Sample Output

2
1 2
5
6 7 9 10 11

1个回答

caozhy      2017.09.17 22:41

Little Busters Ex（ＬＢＥＸ） 修改工具(任意剧情查看工具)

UVa 109 - SCUD Busters（凸包）

Rita - Little busters!
[ar:Rita][ti:Little Busters!][00:00.01]Little busters![00:13.38]　[00:14.26]作詞/作曲：麻枝准　編曲：中沢伴行/尾崎武士[00:20.62]歌：Rita[00:39.96]ひとりが辛(つら)いからふたつの手(て)をつないだ[00:46.29]ふたりじゃ寂(さび)しいから輪(わ)になって手(て)をつないだ[00:52.00
poj 1264 || UVA 109 SCUD Busters
UVA这题过得蛮多人的，觉得应该是个水题吧。 一读题，也不麻烦，给你N个王国，求下凸包，再求面积。给你一些炮弹，问炮弹炸掉的面积。（一个炮弹炸的话，整个王国都被炸了）。 直接求凸包后，求出各个王国的面积，然后判断炮弹在哪个王国里，这个直接用判断点是否在多边形内。 UVA WA了一次，如果多个炮弹打到同一个王国里，面积只算一次的，改了后，A掉了。 poj上一搜，居然也
codeforces 382B B. Number Busters [二分答案+数学]【思维】

UVa 109 - SCUD Busters

POJ 1264 SCUD Busters (凸包面积+判断点是否在凸包内)
POJ 1264 SCUD Busters (凸包面积+判断点是否在凸包内)

Blockchain的鱼和熊掌系列（4）GHOST协议
It is well acknowledged that optimizing the tradeoff between performance and security in a given computing system is always a challenging work.Perhaps the most important work in a Blockchain is the tra
Ghost blog的文件迁移