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
#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map> // hash map
#include <utility>
#include <vector>

#define DEBUG(x) do { cout << #x << " = " << x << '\n';}while(0)
#define MAX 1000000011
#define lli long long int

int T, N, w1, w2, h1, h2, wmin, wmax, hmin, hmax;
bool result;

using namespace std;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> T;
    while (T--)
    {
        cin >> N;
        result = true;
        hmin = MAX;
        wmin = MAX;
        hmax = 0;
        wmax = 0;
        while (N--)
        {
            cin >> w1 >> w2 >> h1 >> h2;
            if ((w1 <= wmin && w2 >= wmax) && (h1 <= hmin && h2 >= hmax))
            {
                wmin = w1;
                wmax = w2;
                hmin = h1;
                hmax = h2;
                result = true;
            }
            else
            {
                if (w1 < wmin)
                {
                    wmin = w1;
                    result = false;
                }
                if (w2 > wmax)
                {
                    wmax = w2;
                    result = false;
                }
                if (h1 < hmin)
                {
                    hmin = h1;
                    result = false;
                }
                if (h2 > hmax)
                {
                    hmax = h2;
                    result = false;
                }
            }
        }
        cout << (result == true ? "TAK\n" : "NIE\n");
    }

    return 0;
}