|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||512 MB||0||0||0||0.000%|
Somewhere in the great North American plains live the tribes of chiefs Blue Eagle, Red Beaver, and Green Serpent. Their population is scattered over numerous villages all over the land and conflict arises whenever members of different tribes meet while traveling across the plains.
To put an end to the constant animosities the chiefs have decided that the land should be divided between the tribes so that they can avoid each other when moving between villages belonging to the same tribe. More precisely, they want to construct two border fences – thus dividing the land into three regions – such that two villages lie in the same region precisely when they belong to the same tribe.
The villages are represented by points in the Euclidean plane that are colored blue, red or green, depending on the tribe, and the fences should be drawn in the form of two polygons. The polygons may not touch or intersect themselves or each other and none of the points may lie on their boundary. (Make sure to read the constraints in the Output section!)
Figure A.1: Illustration of the sample.
The input consists of:
If there is no solution, print impossible. Otherwise, print the two polygons in the following format:
6 0 0 2 0 1 1 1 0 1 1 1 3 2 0 3 2 1 2
4 -0.3 1.0 1.0 -0.3 1.3 0.0 0.0 1.3 4 0.7 1.0 2.0 -0.3 2.3 0.0 1.0 1.3