BZOJ3715 [PA2014]Lustra

额，傻逼题……

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<queue>
#include<stack>
using namespace std;
#define MAXN 100010
#define MAXM 1010
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
#define ll long long
int lh[MAXN],lw[MAXN],rh[MAXN],rw[MAXN];
int LH,LW,RH,RW;
int n;
int main(){
int tmp;
scanf("%d",&tmp);
while(tmp--){
int i;
LH=LW=INF;
RH=RW=-INF;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d%d%d%d",&lw[i],&rw[i],&lh[i],&rh[i]);
LH=min(LH,lh[i]);
LW=min(LW,lw[i]);
RH=max(RH,rh[i]);
RW=max(RW,rw[i]);
}
bool flag=0;
for(i=1;i<=n;i++){
if(lh[i]<=LH&&rh[i]>=RH&&lw[i]<=LW&&rw[i]>=RW){
flag=1;
printf("TAK\n");
break;
}
}
if(!flag){
printf("NIE\n");
}
}
return 0;
}

/*

*/