public:

Point(int _x, int _y):x(_x),y(_y) {}

int x, y;

public:

Rectangle(int a, int b, int c, int d):topLeft(a,d), bottomRight(c,b) { }

int Area(){

return (bottomRight.x - topLeft.x)*(topLeft.y - bottomRight.y);

}

int InclusiveArea (Rectangle &r){

// I include it

if (r.topLeft.x >= topLeft.x && r.bottomRight.x <= bottomRight.x &&

r.topLeft.y <= topLeft.y && r.bottomRight.y >= bottomRight.y ) {

return this->Area();

}

// it includes me

if (r.topLeft.x <= topLeft.x && r.bottomRight.x >= bottomRight.x &&

r.topLeft.y >= topLeft.y && r.bottomRight.y <= bottomRight.y ) {

return r.Area();

}

// 0 - no inclusive

return 0;

}

int OverlappedArea(Rectangle &r) {

int overlap_x = max(0, min(r.bottomRight.x, bottomRight.x) - max(r.topLeft.x, topLeft.x));

int overlap_y = max(0, min(r.topLeft.y, topLeft.y) - max(r.bottomRight.y, bottomRight.y));

return overlap_x * overlap_y;

}

Point topLeft;

Point bottomRight;

using namespace leetcode;

Rectangle r1(A,B,C,D);

Rectangle r2(E,F,G,H);

int area = r1.InclusiveArea(r2);

if (area > 0) return area;

return r1.Area() + r2.Area() - r1.OverlappedArea(r2);

{

//16

cout << "16 : " << computeArea(-1, -1, 1, 1, -2, -2, 2, 2) << endl;

//16

cout << "16 : " << computeArea(-2, -2, 2, 2, -1, -1, 1, 1) << endl;

//17

cout << "17 : " << computeArea(-2, -2, 2, 2, -4, 3, -3, 4) << endl;

//45

cout << "45 : " << computeArea(-3, -0, 3, 4, 0, -1, 9, 2) << endl;

//24

cout << "24 : " << computeArea(-2, -2, 2, 2, -3, -3, 3, -1) << endl;

return 0;