传送门:http://www.lydsy.com/JudgeOnline/problem.php?id=3715
不解释
Code:
#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+10;
int a[maxn],b[maxn],c[maxn],d[maxn];
int getint(){
int res=0;char c=getchar();
while(!isdigit(c))c=getchar();
while(isdigit(c))res=(res<<1)+(res<<3)+c-'0',c=getchar();
return res;
}
int T,n;
int main(){
T=getint();
while(T--){
n=getint();
for(int i=1;i<=n;i++)
a[i]=getint(),b[i]=getint(),
c[i]=getint(),d[i]=getint();
int A=*min_element(a+1,a+1+n);
int B=*max_element(b+1,b+1+n);
int C=*min_element(c+1,c+1+n);
int D=*max_element(d+1,d+1+n);
int ok=0;
for(int i=1;i<=n;i++){
if(a[i]==A&&b[i]==B&&c[i]==C&&d[i]==D){
puts("TAK");ok=1;break;
}
}if(!ok)puts("NIE");
}
return 0;
}