Asia Daejeon Regional Contests 2011, no.A Block Compaction October 01, 2013

#include<cstdio>
#include<climits>
#include<cstring>
#include <vector>
#include<algorithm>
using namespace std;
  
struct point{
    int x,y,p,q;
    point(){}
    point(int x,int y,int p,int q):
    x(x),y(y),p(p),q(q){}
};
int T;
bool cmpX(const point& e1,const point& e2) {
    if ( e1.x != e2.x ) return e1.x<e2.x;
    return e1.y<e2.y;
}
bool cmpY(const point& e1,const point& e2) {
    if ( e1.y != e2.y ) return e1.y<e2.y;
    return e1.x<e2.x;
}
int main()
{
    for (scanf("%d", &T); T--;) {
        int n;
        scanf("%d",&n);
        vector<point> v;
        for ( int i = 0 ; i < n ; i++ ) {
            point t;
            scanf("%d%d%d%d",&t.x,&t.y,&t.p,&t.q);
            v.push_back(t);
        }
        bool ok=true;
        point ans(INT_MAX,INT_MAX,INT_MIN,INT_MIN);
        while ( ok ) {
            ok = false;
            sort(v.begin(),v.end(),cmpY);
            for ( int i = 0 ; i < n ; i++ ) {
                if ( !v[i].y ) continue;
                int now =0;
                for ( int j = 0 ; j < i ; j++ )
                    if ( ((v[j].x >= v[i].x && v[j].x < v[i].p) || (v[j].p >v[i].x && v[j].p <= v[i].p)) || (v[j].x <= v[i].x && v[j].p >= v[i].p)) 
                        now = max(now,v[j].q);
                if ( v[i].y == now ) continue;
                int diff=v[i].q-v[i].y;
                v[i].y = now;
                v[i].q = now+diff;
                ok = true;
            }
            sort(v.begin(),v.end(),cmpX);
            for ( int i = 0 ; i < n ; i++ ) {
                if ( !v[i].x ) continue;
                int now=0;
                for ( int j = 0 ; j < i ; j++ )
                    if ( ((v[j].y >= v[i].y && v[j].y < v[i].q) || (v[j].q > v[i].y && v[j].q <= v[i].q)) || (v[j].y <= v[i].y && v[j].q >= v[i].q) ) 
                        now = max(now,v[j].p);
                if ( v[i].x == now ) continue;
                int diff=v[i].p-v[i].x;
                v[i].x = now;
                v[i].p = now+diff;
                ok = true;
            }
        }
        for ( int i = 0 ; i < n ; i++ ) {
            ans.q = max(ans.q,v[i].q);
            ans.p = max(ans.p,v[i].p);
            ans.x = min(ans.x,v[i].x);
            ans.y = min(ans.y,v[i].y);
        }
        printf("%d %d\n",ans.p-ans.x,ans.q-ans.y);
  
    }
    return 0;
}