ZOJ (狗狗)1426 Counting Rectangles(暴力)

Counting Rectangles

---

Time Limit: 2 Seconds      Memory Limit: 65536 KB

---

We are given a figure consisting of only horizontal and vertical line segments. Our goal is to count the number of all different rectangles formed by these segments. As an example, the number of rectangles in the Figures 1 and 2 are 5 and 0 respectively.

There are many intersection points in the figure. An intersection point is a point shared by at least two segments. The input line segments are such that each intersection point comes from the intersection of exactly one horizontal segment and one vertical segment.

Input

The first line of the file contains a single number M, which is the number of test cases in the file (1 <= M <= 10), and the rest of the file consists of the data of the test cases. Each test case begins with a line containing s (1 <= s <= 100), the number of line segments in the figure. It follows by s lines, each containing x and y coordinates of two end points of a segment respectively. The coordinates are integers in the range of 0 to 1000.

Output

The output for each test case is the number of all different rectangles in the figure described by the test case. The output for each test case must be written on a separate line.

Sample Input

2
6
0 0 0 20
0 10 25 10
20 10 20 20
0 0 10 0
10 0 10 20
0 20 20 20
3
5 0 5 20
15 5 15 25
0 10 25 10

Sample Output

5
0

The above input file contains two test cases corresponding to Figures 1 and 2 respectively.

题目大意：

　　就是说给你n条直线，n<=100,且这n条直线两两相互平行，都是垂直于x轴线或者垂直于y轴的。那么这n条直线中能组成的矩形有多少个?

解题思路：

　　直接上来就暴力吧，先开始我们只要将横着的线和竖着的线分别统计进入两个不同的类，然后从这两个类中开始依次判断。乍一看，以为是规律题，画了5组，发现，我们只要先枚举任意两条横向平行的直线，然后在寻找与这两条有交点的纵向的直线，每次增加一条竖着的直线，那么就会给tot贡献(cnt-1)*cnt/2，，多画几个就能推理出来了，然后，就这样每次两条枚举完所有的横向直线。

　　第一次用类写，有点手抖，但是还是1Y了。

代码：

# include<cstdio>
# include<iostream>
# include<fstream>
# include<algorithm>
# include<functional>
# include<cstring>
# include<string>
# include<cstdlib>
# include<iomanip>
# include<numeric>
# include<cctype>
# include<cmath>
# include<ctime>
# include<queue>
# include<stack>
# include<list>
# include<set>
# include<map>

using namespace std;

const double PI=4.0*atan(1.0);

typedef long long LL;
typedef unsigned long long ULL;

# define inf 999999999
# define MAX 1000+4

int num;//直线的条数

class rectangle
{
public:
    int x1,y1,x2,y2;
    void set ( int a,int b,int c,int d )
    {
        x1 = a;
        y1 = b;
        x2 = c;
        y2 = d;
    }
};

rectangle aa[MAX];
rectangle bb[MAX];

int check ( rectangle & a, rectangle & b )
{
    return b.y1<=a.y1 && a.y1<=b.y2 && a.x1<=b.x1 && b.x1<=a.x2;
}

int main(void)
{
    int t;cin>>t;
    while ( t-- )
    {
        cin>>num;
        int  H = 0, S = 0;
        for ( int i = 0;i < num;i++ )
        {
            int x,y,x1,y1;
            cin>>x>>y>>x1>>y1;
            if ( x==x1 )
            {//竖线集
                if ( y > y1 )
                {
                    aa[S++].set(x1,y1,x,y);
                }
                else
                {
                    aa[S++].set(x,y,x1,y1);
                }
            }
            else
            {//横线集
                if ( x > x1 )
                {
                    bb[H++].set(x1,y1,x,y);
                }
                else
                {
                    bb[H++].set(x,y,x1,y1);
                }
            }

        }

        int tot = 0;
        for ( int i = 0;i < H-1;i++ )
        {
            for ( int j = i+1;j < H;j++ )
            {
                int cnt = 0;
                for ( int k = 0;k < S;k++ )
                {
                    if ( check( bb[i],aa[k]) && check( bb[j],aa[k]) )
                    {
                        cnt++;
                    }
                }
                tot+=(cnt-1)*cnt/2;
            }
        }


        cout<<tot<<endl;
    }




    return 0;
}