|
||||||||||
BurningTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 717 Accepted Submission(s): 294 Special Judge Problem Description The sky is BURNING,and you find there are n triangles on a plane. For every point p,if there's exactly k triangles contains it,then define it's thickness as k. For every i from 1 to n,calculate the area of all points whose thickness is i. Input The first line contains integer T(T <= 5),denote the number of the test cases. For each test cases,the first line contains integer n(1 <= n <= 50),denote the number of the triangles. Then n lines follows,each line contains six integers x1, y1, x2, y2, x3, y3, denote there's a triangle with vertices (x1, y1), (x2, y2), (x3, y3). 0 <= xi, yi <= 100 for every i. Output For each test cases,print n lines,the i-th is the total area for thickness i. The answer will be considered correct if its absolute error doesn't exceed 10-4. Sample Input
Sample Output
Hint Triangle can be degenerated(3 points on a line,even 3 points are the same). Author WJMZBMR Source | ||||||||||
|