hdu 6665 （2019 Multi-University Training Contest 8

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 3228    Accepted Submission(s): 613

Problem Description

Calabash is the servant of a landlord. The landlord owns a piece of land, which can be regarded as an infinite 2D plane.

One day the landlord set up two orthogonal rectangular-shaped fences on his land. He asked Calabash a simple problem: how many nonempty connected components is my land divided into by these two fences, both finite and infinite? Calabash couldn't answer this simple question. Please help him!

Recall that a connected component is a maximal set of points not occupied by the fences, and every two points in the set are reachable without crossing the fence.

 

Input

The first line of input consists of a single integer T (1≤T≤10000), the number of test cases.

Each test case contains two lines, specifying the two rectangles. Each line contains four integers x1,y1,x2,y2 (0≤x1,y1,x2,y2≤109,x1<x2,y1<y2), where (x1,y1),(x2,y2) are the Cartesian coordinates of two opposite vertices of the rectangular fence. The edges of the rectangles are parallel to the coordinate axes. The edges of the two rectangles may intersect, overlap, or even coincide.

 

Output

For each test case, print the answer as an integer in one line.

 

Sample Input

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

 

Sample Output

3 4 2

题意:两个矩形，问这两个矩形可以将平面分割成几个部分。

思路:分析，一共可以分割为2,3,4,5,6这五种情况，4的时候情况比较多，其他四种容易

判断，所以直接判断其他四种情况即可。（比较菜，没想出来好的方法）

题目给出x1<x2,y1<y2;所以不会有非矩形的样例

设结果为ans

当ans = 6，只有这一种情况

当ans = 3时，有相离，内含的情况

当ans = 2时，重合

当ans = 5时，

当ans = 4时，（或者还有其他的方式，else了..）

#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>
#define int long long
#define rad rand()%mod+1
using namespace std;
typedef long long ll;
const int maxn = 1e6+5;
const int maxm = 1e3+5;
const int mod = 1e9+7;

signed main()
{
    int x1, x2, x3, x4;
    int y1, y2, y3, y4;
    int t;
    scanf("%lld", &t);
    while(t--)
    {
        scanf("%lld %lld %lld %lld", &x1, &y1, &x2, &y2);
        scanf("%lld %lld %lld %lld", &x3, &y3, &x4, &y4);
        ///为6的情况
        if(x1 < x3&&x4 < x2&&y1> y3&&y2 < y4)
        {
            printf("6
");
            continue;
        }
        if(x3 < x1&&x2 < x4&&y3 > y1&&y2 > y4)
        {
            printf("6
");
            continue;
        }
        ///相离
        if(x2 < x3||x4 < x1||y3 > y2||y1 > y4)
        {
            printf("3
");
            continue;
        }
        ///重合
        if(x1 == x3&&y1 == y3&&x2 == x4&&y2 == y4)
        {
            printf("2
");
            continue;
        }
        ///两条边重合
        if(x1 == x3 && x2 == x4&&((y1 < y3&&y4 < y2 )||(y1> y3&&y4 > y2)))
        {
            printf("4
");
            continue;
        }
        if(y1 == y3&&y2 == y4&&((x1 < x3&&x4 < x2|| (x3 < x1&&x2 < x4)) ))
        {
            printf("4
");
            continue;
        }
        ///内含
        if(x1 <= x3&&x4 <= x2&&y4<=y2&&y3>=y1)
        {
            printf("3
");
            continue;
        }
        if(x3 <= x1&&x2 <= x4&&y1 >= y3&&y2 <= y4)
        {
            printf("3
");
            continue;
        }
        ///有一条边重合  (外)
        if(x2 == x3 || x1 == x4||y2 == y3 || y1 == y4)
        {
            printf("3
");
            continue;
        }
        ///为5 的情况
        if(x1 == x3)
        {
            if((y1 < y3 && y4 < y2) || (y1 > y3 &&y4 > y2))
            {
                printf("5
");
                continue;
            }
        }
        if(y1 == y3)
        {
            if((x1 < x3 && x4 < x2)||(x3 < x1&&x2 < x4) )
            {
                printf("5
");
                continue;
            }
        }
        if(x2 == x4)
        {
            if((y1 < y3 && y4 < y2) || (y1 > y3 && y4 > y2) )
            {
                printf("5
");
                continue;
            }
        }
        if(y2 == y4)
        {
            if((x1 < x3 && x4 < x2)||(x1 > x3 && x4 > x2))
            {
                printf("5
");
                continue;
            }
        }
        printf("4
");
    }
    return 0;
}

/***

***/