CF68E.Contact

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Little Petya is preparing for the first contact with aliens. He knows that alien spaceships have shapes of non-degenerate triangles and there will be exactly 4 ships. Landing platform for a ship can be made of 3 special columns located at some points of a Cartesian plane such that these 3 points form a triangle equal to the ship with respect to rotations, translations (parallel shifts along some vector) and reflections (symmetries along the edges). The ships can overlap after the landing.

Each column can be used to land more than one ship, for example, if there are two equal ships, we don't need to build 6 columns to land both ships, 3 will be enough. Petya wants to know what minimum number of columns will be enough to land all ships.

输入格式

Each of 4 lines will contain 6 integers x1x_{1} y1y_{1} x2x_{2} y2y_{2} x3x_{3} y3y_{3} ( 0<=x1,y1,x2,y2,x3,y3<=200<=x_{1},y_{1},x_{2},y_{2},x_{3},y_{3}<=20 ), representing 3 points that describe the shape of each of 4 ships. It is guaranteed that 3 points in each line will represent a non-degenerate triangle.

输出格式

First line should contain minimum number of columns enough to land all spaceships.

输入输出样例

  • 输入#1

    0 0 1 0 1 2
    0 0 0 2 2 2
    0 0 3 0 1 2
    0 0 3 0 2 2
    

    输出#1

    4
    
  • 输入#2

    0 0 0 1 1 1
    0 0 0 2 2 2
    0 0 0 5 5 5
    0 0 0 17 17 17
    

    输出#2

    9
    

说明/提示

In the first test case columns can be put in these points: (0,0),(1,0),(3,0),(1,2)(0,0),(1,0),(3,0),(1,2) . Note that the second ship can land using last 3 columns.

In the second test case following points can be chosen: (0,0),(0,1),(1,0),(0,2),(2,0),(0,5),(5,0),(0,17),(17,0)(0,0),(0,1),(1,0),(0,2),(2,0),(0,5),(5,0),(0,17),(17,0) . It is impossible to use less than 9 columns.

首页