Codeforces 617D Polyline【思维+分类讨论】

D. Polyline

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There are three points marked on the coordinate plane. The goal is to make a simple polyline, without self-intersections and self-touches, such that it passes through all these points. Also, the polyline must consist of only segments parallel to the coordinate axes. You are to find the minimum number of segments this polyline may consist of.

Input

Each of the three lines of the input contains two integers. The i-th line contains integers x_i and y_i ( - 10⁹ ≤ x_i, y_i ≤ 10⁹) — the coordinates of the i-th point. It is guaranteed that all points are distinct.

Output

Print a single number — the minimum possible number of segments of the polyline.

Examples

Input

1 -1
1 1
1 2

Output

1

Input

-1 -1
-1 3
4 3

Output

2

Input

1 1
2 3
3 2

Output

3

Note

The variant of the polyline in the first sample: The variant of the polyline in the second sample: The variant of the polyline in the third sample:

题目大意：

给你三个点，问你最少用几条如样例图所示的平行于坐标轴的线，就能将三个点串在一起。

思路：

1、首先判断1的情况，同样也是最好判的情况，当三个点的x坐标相同的时候，或者三个点的y坐标相同的时候，即输出1.

2、然后我们分析，一共就三个点，最多其实也就用三条线就足够了，那么我们要么讨论2的情况，其余就是3，要么讨论3的情况，其余就是2，我这里讨论2的情况：

①对应任意两点的y坐标相同，那么另外一点的x坐标如果等于这两个坐标的任意一个是可行解，或者这另外一点的x坐标如果在这两个坐标的x坐标的左边或者右边都是可行解（如图）：

3、那么如果对应两点x坐标相同也是同理。那么我们对应三个点，判断六次即可。

Ac代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
using namespace std;
struct node
{
    int x,y;
}a[5];
int main()
{
    while(~scanf("%d%d%d%d%d%d",&a[0].x,&a[0].y,&a[1].x,&a[1].y,&a[2].x,&a[2].y))
    {
        if(a[0].x==a[1].x&&a[1].x==a[2].x){printf("1\n");continue;}
        if(a[0].y==a[1].y&&a[1].y==a[2].y){printf("1\n");continue;}
        if(a[0].x==a[1].x)
        {
            if(a[0].y==a[2].y||a[1].y==a[2].y)
            {
                printf("2\n");
                continue;
            }
            if(a[2].y<min(a[0].y,a[1].y)||a[2].y>max(a[0].y,a[1].y))
            {
                printf("2\n");
                continue;
            }
        }
        if(a[0].x==a[2].x)
        {
            if(a[0].y==a[1].y||a[1].y==a[2].y)
            {
                printf("2\n");
                continue;
            }
            if(a[1].y<min(a[0].y,a[2].y)||a[1].y>max(a[0].y,a[2].y))
            {
                printf("2\n");
                continue;
            }
        }
        if(a[1].x==a[2].x)
        {
            if(a[1].y==a[0].y||a[2].y==a[0].y)
            {
                printf("2\n");
                continue;
            }
            if(a[0].y<min(a[1].y,a[2].y)||a[0].y>max(a[1].y,a[2].y))
            {
                printf("2\n");
                continue;
            }
        }
        if(a[0].y==a[1].y)
        {
            if(a[0].x==a[2].x||a[1].x==a[2].x)
            {
                printf("2\n");
                continue;
            }
            if(a[2].x<min(a[1].x,a[0].x)||a[2].x>max(a[1].x,a[0].x))
            {
                printf("2\n");
                continue;
            }
        }
        if(a[0].y==a[2].y)
        {
            if(a[0].x==a[1].x||a[1].x==a[2].x)
            {
                printf("2\n");
                continue;
            }
            if(a[1].x<min(a[0].x,a[2].x)||a[1].x>max(a[0].x,a[2].x))
            {
                printf("2\n");
                continue;
            }
        }
        if(a[1].y==a[2].y)
        {
            if(a[1].x==a[0].x||a[2].x==a[0].x)
            {
                printf("2\n");
                continue;
            }
            if(a[0].x<min(a[1].x,a[2].x)||a[0].x>max(a[1].x,a[2].x))
            {
                printf("2\n");
                continue;
            }
        }
        printf("3\n");
    }
}