当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5846:Convex Hull

题目描述
There are n points in three dimensional space.

Consider the convex hull of n points.

Given a plane, you should work out the area of section of convex hull by the plane.
输入解释
First line contains T(T <= 10), a number of test cases.

For each test case, there are two integer n and m, number of points and number of queries.

Next n lines contains three integers x, y, z, coordinate of point.

Next m lines contains four integers a, b, c, d, specifying the equation of plane: ax + by + cz + d = 0.

1 <= n <= 1000
1 <= q <= 1000
Absolute values of x, y, z, a, b, c and d are not greater than 2000.
输出解释
For each test case, first line contains “Case #x:”, x is the number of the case.
For each query, you should print one float number in three decimal places in one line.
输入样例
1
6 1
0 0 1
1 0 1
0 1 1
0 0 -1
1 0 -1
0 1 -1
0 0 1 0
输出样例
Case #1:
0.500
来自杭电HDUOJ的附加信息
Author 金策工业综合大学(DPRK)
Recommend wange2014

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-5846

最后修改于 2020-10-25T23:26:08+00:00 由爬虫自动更新

共提交 3

通过率 0.0%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)