IoU

IoU

 #include <cstdio>
 #include <algorithm>
 #define re(i,a,b) for(int i=a;i<=b;i++)
 using namespace std;

 int main(){
     int T; scanf("%d", &T);
     while(T--){
         int x[],y[],w[],h[];
         re(i,,) scanf("%d%d%d%d", &x[i],&y[i],&w[i],&h[i]);
         double sum=;
         re(i,,) sum+=w[i]*h[i];
         double overlap=(min(x[]+w[],x[]+w[])-max(x[],x[]))*
                     (min(y[]+h[],y[]+h[])-max(y[],y[]));
         if((min(x[]+w[],x[]+w[])-max(x[],x[]))< && overlap>) overlap=;
         if(overlap<=) printf("0.00\n");
         else printf("%.2lf\n", overlap/(sum-overlap));
     }
     return ;
 }