kot_mapku3

1 H

Jun 2nd, 2020
588
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.60 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int length(int l1, int r1, int l2, int r2){
  6.     int l = max(l1, l2);
  7.     int r = min(r1, r2);
  8.  
  9.     if (r < l) return 0; // пересечения нет
  10.     else return r - l;
  11.  
  12.     return 0;
  13. }
  14.  
  15. int main(){
  16.     int x1,x2,x3,x4;
  17.     int y1,y2,y3,y4;
  18.  
  19.     cin >> x1 >> y1 >> x2 >> y2;
  20.     cin >> x3 >> y3 >> x4 >> y4;
  21.  
  22.     if (x2 < x1) swap(x1,x2);
  23.     if (x4 < x3) swap(x3,x4);
  24.     if (y2 < y1) swap(y1,y2);
  25.     if (y4 < y3) swap(y3,y4);
  26.  
  27.     int w = length(x1,x2,x3,x4);
  28.     int h = length(y1,y2,y3,y4);
  29.  
  30.     cout << w * h;
  31.  
  32.     return 0;
  33. }
Advertisement
Add Comment
Please, Sign In to add comment