首页 > ACM题库 > HDU-杭电 > hdu 3608 TT待解决[解题报告]C++
2014
11-27

hdu 3608 TT待解决[解题报告]C++

TT

问题描述 :

Association of Collision Management (ACM) is planning to perform the controlled collision of two as-teroids. The asteroids will be slowly brought together and collided at negligible speed. ACM expects asteroids to get attached to each other and form a stable object. Each asteroid has the form of a convex polyhedron. To increase the chances of success of the experiment ACM wants to bring asteroids together in such manner that their centers of mass are as close as possible.
To achieve this, ACM operators can rotate the asteroids and move them independently before bringing them together. Help ACM to find out what minimal distance between centers of mass can be achieved. For the purpose of calculating center of mass both asteroids are considered to have constant density.

输入:

Input file contains two descriptions of convex polyhedra.
The first line of each description contains integer number n indicate the number of vertices of the polyhedron (4 <= n <= 60). The following n lines contain three integer numbers xi; yi; zi each — the coordinates of the polyhedron vertices (-10000 <= xi, yi, zi <= 10000). It is guaranteed that the given points are vertices of a convex polyhedron, in particular no point belongs to the convex hull of other points. Each polyhedron is non-degenerate. The two given polyhedra have no common points.

输出:

Input file contains two descriptions of convex polyhedra.
The first line of each description contains integer number n indicate the number of vertices of the polyhedron (4 <= n <= 60). The following n lines contain three integer numbers xi; yi; zi each — the coordinates of the polyhedron vertices (-10000 <= xi, yi, zi <= 10000). It is guaranteed that the given points are vertices of a convex polyhedron, in particular no point belongs to the convex hull of other points. Each polyhedron is non-degenerate. The two given polyhedra have no common points.

样例输入:

8
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
5
0 0 5
1 0 6
-1 0 6
0 1 6
0 -1 6

样例输出:

0.75


  1. I like your publish. It is great to see you verbalize from the coronary heart and clarity on this essential subject matter can be easily noticed.

  2. [email protected]

  3. 第一句可以忽略不计了吧。从第二句开始分析,说明这个花色下的所有牌都会在其它里面出现,那么还剩下♠️和♦️。第三句,可以排除2和7,因为在两种花色里有。现在是第四句,因为♠️还剩下多个,只有是♦️B才能知道答案。