1429. Polygon Programming with Ease

单点时限: 2.0 sec

内存限制: 256 MB

Read the statement of Problem 1939! Given a list of meeting locations as specified in the description of Problem 1939, you have to calculate the locations of the Foreign Offices.

输入格式

See the input specification of Problem 1939 for the format, and the output specification of Problem 1939 for the meaning of the input.

输出格式

See the output specification of Problem 1939 for the format, and the input specification of Problem 1939 for the meaning of the output.

样例

Input
5 14 2 20 4 18 12 12 18 10 10
3 -3 5 -2 5 -3 6
3 -2 10 5 10 -1 12
Output
5 10.000000 2.000000 18.000000 2.000000 22.000000 6.000000 14.000000 18.000000 10.000000 18.000000
3 -4.000000 6.000000 -2.000000 4.000000 -2.000000 6.000000
3 -8.000000 12.000000 4.000000 8.000000 6.000000 12.000000
Hint
The relationship between the sample input and output polygons is illustrated in the figure below. Solid lines indicate the polygon joining the Foreign Offices, whereas dashed lines indicate the polygon joining the meeting locations. To generate further sample input you may use your solution to Problem 1939.

4 人解决,6 人已尝试。

4 份提交通过,共有 6 份提交。

7.3 EMB 奖励。

创建: 13 年,2 月前.

修改: 3 年,1 月前.

最后提交: 6 年,6 月前.

来源: Ulm Local 2002

题目标签