Cod sursa(job #3322335)

Utilizator BiceaToader David Stefan Bicea Data 13 noiembrie 2025 15:25:00
Problema Reuniune Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.85 kb
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("reuniune.in");
ofstream g("reuniune.out");
long long a[8][3],b[8][3],k,s,t;
long long arie(int i)
{
  return ((b[i][1]-a[i][1])*(b[i][2]-a[i][2]));
}
long long perimetru(int i)
{
  return ((b[i][1]-a[i][1])+(b[i][2]-a[i][2]));
}
void inter(int i , int j)
{
  k++;
  a[k][1]=max(a[i][1],a[j][1]);
  a[k][2]=max(a[i][2],a[j][2]);
  b[k][1]=min(b[i][1],b[j][1]);
  b[k][2]=min(b[i][2],b[j][2]);
}
int main()
{for(int i=1;i<=3;++i)
cin>>a[i][1]>>a[i][2]>>b[i][1]>>b[i][2];
k=3;
s+=arie(1);
s+=arie(2);
s+=arie(3);
t+=arie(1);
t+=arie(2);
t+=arie(3);
inter(1,2);
s-=arie(4);
t-=(perimetru(4)/2);
inter(1,3);
s-=arie(5);
t-=(perimetru(5)/2);
inter(2,3);
s-=arie(6);
t-=(perimetru(6)/2);
inter(1,4);
s+=arie(7);
t+=(perimetru(7)/2);
g<<s<<" "<<t;
    return 0;
}