#include<algorithm> #include<bitset> #include<cassert> #include<complex> #include<cstring> #include<cstdio> #include<iomanip> #include<map> #include<iostream> #include<queue> #include<set> #include<stack> #include<string> #include<vector> #define FOR(i,a,b) for(int i=(a); i<=(b); ++i) #define FORD(i,a,b) for(int i=(a); i>=(b); --i) #define REP(i,n) for(int i=0; i<(n); ++i) #define VAR(v,i) __typeof(i) v = (i) #define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define ALL(x) (x).begin(),(x).end() #define SZ(x) ((int)(x).size()) #define PB push_back #define MP make_pair #define X first #define Y second #define debug(x) { cerr << #x <<" = " << (x) << endl; } #define debugv(x) { cerr << #x << " = "; FORE(it, x) cerr << *it << ", "; cerr << endl; } #define dprintf(...) fprintf(stderr, __VA_ARGS__) using namespace std; typedef pair<int, int> PII;; typedef vector<int> VI; typedef long long LL; typedef long double LD; template<class C> void mini(C&a4, C b4) { a4 = min(a4,b4); } template<class C> void maxi(C&a4, C b4) { a4 = max(a4,b4); } template<class T1, class T2> ostream& operator<<(ostream &out, pair<T1, T2> pair) { return out << "(" << pair.X << ", "<< pair.Y << ")"; }; const int N = 100000; int w1[N], w2[N], h1[N], h2[N]; void doit() { int n; scanf("%d", &n); REP(i, n) scanf("%d %d %d %d", &w1[i], &w2[i], &h1[i], &h2[i]); int minH = 1000000000; int maxH = 0; int minW = 1000000000; int maxW = 0; REP(i, n) { mini(minH, h1[i]); maxi(maxH, h2[i]); mini(minW, w1[i]); maxi(maxW, w2[i]); } REP(i, n) { if (h1[i] == minH && h2[i] == maxH && w1[i] == minW && w2[i] == maxW) { printf("TAK\n"); return; } } printf("NIE\n"); return; } int main() { ios_base::sync_with_stdio(); cout << fixed << setprecision(10); int ttt; scanf("%d", &ttt); while (ttt--) doit(); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 | #include<algorithm> #include<bitset> #include<cassert> #include<complex> #include<cstring> #include<cstdio> #include<iomanip> #include<map> #include<iostream> #include<queue> #include<set> #include<stack> #include<string> #include<vector> #define FOR(i,a,b) for(int i=(a); i<=(b); ++i) #define FORD(i,a,b) for(int i=(a); i>=(b); --i) #define REP(i,n) for(int i=0; i<(n); ++i) #define VAR(v,i) __typeof(i) v = (i) #define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define ALL(x) (x).begin(),(x).end() #define SZ(x) ((int)(x).size()) #define PB push_back #define MP make_pair #define X first #define Y second #define debug(x) { cerr << #x <<" = " << (x) << endl; } #define debugv(x) { cerr << #x << " = "; FORE(it, x) cerr << *it << ", "; cerr << endl; } #define dprintf(...) fprintf(stderr, __VA_ARGS__) using namespace std; typedef pair<int, int> PII;; typedef vector<int> VI; typedef long long LL; typedef long double LD; template<class C> void mini(C&a4, C b4) { a4 = min(a4,b4); } template<class C> void maxi(C&a4, C b4) { a4 = max(a4,b4); } template<class T1, class T2> ostream& operator<<(ostream &out, pair<T1, T2> pair) { return out << "(" << pair.X << ", "<< pair.Y << ")"; }; const int N = 100000; int w1[N], w2[N], h1[N], h2[N]; void doit() { int n; scanf("%d", &n); REP(i, n) scanf("%d %d %d %d", &w1[i], &w2[i], &h1[i], &h2[i]); int minH = 1000000000; int maxH = 0; int minW = 1000000000; int maxW = 0; REP(i, n) { mini(minH, h1[i]); maxi(maxH, h2[i]); mini(minW, w1[i]); maxi(maxW, w2[i]); } REP(i, n) { if (h1[i] == minH && h2[i] == maxH && w1[i] == minW && w2[i] == maxW) { printf("TAK\n"); return; } } printf("NIE\n"); return; } int main() { ios_base::sync_with_stdio(); cout << fixed << setprecision(10); int ttt; scanf("%d", &ttt); while (ttt--) doit(); return 0; } |