bzoj3715 [PA2014]Lustra 暴力

签到题，送经验。

#include<cstdio>#include<algorithm>#include<cstring>#define fo(i,a,b) for(int i=a;i<=b;i++)#define fd(i,a,b) for(int i=a;i>=b;i--)using namespace std;typedef long long ll;const int N=2e5+5;int n,m;int w1,w2,h1,h2,a1[N],a2[N],b1[N],b2[N];int main(){    int cas;    scanf("%d",&cas);    while (cas--)    {        scanf("%d",&n);        w1=h1=1e9;        w2=h2=0;        fo(i,1,n)        {            scanf("%d%d%d%d",&a1[i],&a2[i],&b1[i],&b2[i]);            w1=min(w1,a1[i]);            w2=max(w2,a2[i]);            h1=min(h1,b1[i]);            h2=max(h2,b2[i]);        }        bool flag=0;        fo(i,1,n)        {            if (a1[i]==w1&&a2[i]==w2&&b1[i]==h1&&b2[i]==h2)flag=1;            if (flag)break;        }        if (flag)printf("TAK\n");        else printf("NIE\n");    }}