【C++OJ_静态与友元】判断矩形是否重叠(复合类+友元)
题目描述
用CPoint表示点,用两个CPoint对象表示矩形类CRect的对角线两点。分别实现CPoint类和CRect类,并在主函数用输入的坐标定义4个CPoint类对象,每2个CPoint对象再构造1个CRect对象,然后写个友元函数,判断2个矩形是否重叠。
输入
判断次数
矩形1的对角线顶点坐标x1, y1, x2, y2
矩形2的对角线顶点坐标x1, y1, x2, y2
…
输出
是否重叠
输入样例
3
1 5 2 9
1 3 2 4
5 6 7 8
5 7 7 7
2 5 1 0
9 4 2 9
输出样例
not overlapped
overlapped
overlapped
参考代码
#include <iostream>
using namespace std;
class CRect;
class CPoint
{
int x, y;
public:
CPoint() {}
CPoint(int xx, int yy) : x(xx), y(yy) {}
friend bool isoverlap(CRect &rect1, CRect &rect2);
};
class CRect
{
CPoint p1, p2;
public:
CRect(CPoint l, CPoint r) : p1(l), p2(r) {}
CRect(int x1, int y1, int x2, int y2) : p1(x1, y1), p2(x2, y2) {}
friend bool isoverlap(CRect &rect1, CRect &rect2);
};
bool isoverlap(CRect &rect1, CRect &rect2) //只要rect2出现的情况在rect1的四周时,就不重叠
{
if (rect1.p2.x < rect1.p1.x) //找到rect1的最小x:p1.x(大的x:p2.x)
swap(rect1.p2.x, rect1.p1.x);
if (rect1.p2.y < rect1.p1.y) //找到rect1的最小y:p1.y(大的y:p2.y)
swap(rect1.p2.y, rect1.p1.y);
if (rect2.p2.x < rect2.p1.x) //找到rect2的最小x:p1.x(大的x:p2.x)
swap(rect2.p2.x, rect2.p1.x);
if (rect2.p2.y < rect2.p1.y) //找到rect2的最小y:p1.y(大的y:p2.y)
swap(rect2.p2.y, rect2.p1.y);
if (rect2.p1.x > rect1.p2.x || rect2.p2.x < rect1.p1.x || rect2.p1.y > rect1.p2.y || rect2.p2.y < rect1.p1.y)
{ //画图四种情况:Xmin>x2 || Xmax<x1 || Ymin>y2 || Ymax<y1
cout << "not overlapped" << endl;
return true;
}
else
{
cout << "overlapped" << endl;
return false;
}
}
int main()
{
int t;
cin >> t;
int x1, y1, x2, y2, x3, y3, x4, y4;
while (t--)
{
cin >> x1 >> y1 >> x2 >> y2 >> x3 >> y3 >> x4 >> y4;
CPoint cp1(x1, y1), cp2(x2, y2), cp3(x3, y3), cp4(x4, y4); //在主函数用输入的坐标定义4个CPoint类对象
CRect cr1(x1, y1, x2, y2); //每2个CPoint对象再构造1个CRect对象
CRect cr2(x3, y3, x4, y4);
isoverlap(cr1, cr2); //友元函数,判断2个矩形是否重叠
}
return 0;
}