F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Convex Hull

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 291    Accepted Submission(s): 43


Problem Description
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.
 

Input
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.
 

Output
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.
 

Sample Input
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
 

Sample Output
Case #1: 0.500
 

Author
金策工业综合大学(DPRK)
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-05-07 14:38:16, Gzip enabled