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
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
//Maciej Poleski
#ifdef DEBUG
#define _GLIBCXX_CONCEPT_CHECKS
#include <iostream>
#include <fstream>
#include <cstdlib>
#include <cassert>
namespace
{
namespace Wrapper
{
std::ifstream in;
std::ofstream out;
}
void init(int argc, char **argv)
{
    if (argc != 3)
    {
        std::cerr << "Potrzeba dokładnie dwóch argumentów\n";
        std::abort();
    }
    Wrapper::in.open(argv[1]);
    Wrapper::out.open(argv[2]);
}
}
#define check(x) assert(x)
#else
#ifndef NDEBUG
#define NDEBUG
#endif
#define check(x)
#include <iostream>
namespace
{
namespace Wrapper
{
std::istream &in = std::cin;
std::ostream &out = std::cout;
}
}
#endif

#include <cstdint>

namespace
{
namespace Wrapper
{
typedef std::uint_fast64_t uint_fast64_t;
typedef std::uint_fast32_t uint_fast32_t;
typedef std::uint_fast16_t uint_fast16_t;
typedef std::uint_fast8_t uint_fast8_t;

typedef std::uint64_t uint64_t;
typedef std::uint32_t uint32_t;
typedef std::uint16_t uint16_t;
typedef std::uint8_t uint8_t;

typedef std::int_fast64_t int_fast64_t;
typedef std::int_fast32_t int_fast32_t;
typedef std::int_fast16_t int_fast16_t;
typedef std::int_fast8_t int_fast8_t;

typedef std::int64_t int64_t;
typedef std::int32_t int32_t;
typedef std::int16_t int16_t;
typedef std::int8_t int8_t;

typedef std::size_t size_t;
}

}

#include <string>
#include <algorithm>
#include <limits>
#include <locale>
#include <cstring>
#include <utility>
#include <cstdlib>
#include <tr1/random>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <iomanip>
#include <set>
#include <map>
#include <memory>
#include <functional>
#include <unordered_map>
#include <unordered_set>
#include <complex>

namespace
{
using namespace Wrapper;

struct Offer
{
    int minw,maxw;
    int minh,maxh;
};

inline static void solution()
{
    using std::swap;
    std::uint_fast32_t z;
    in >> z;
    while (z--)
    {
        uint_fast32_t n;
        in >> n;
        Offer* data=new Offer[n];
        int globalMinw=std::numeric_limits<int>::max();
        int globalMaxw=std::numeric_limits<int>::min();
        int globalMinh=std::numeric_limits<int>::max();
        int globalMaxh=std::numeric_limits<int>::min();
        for(uint_fast32_t i=0;i<n;++i)
        {
            in>>data[i].minw>>data[i].maxw>>data[i].minh>>data[i].maxh;
            globalMinw=std::min(globalMinw,data[i].minw);
            globalMaxw=std::max(globalMaxw,data[i].maxw);
            globalMinh=std::min(globalMinh,data[i].minh);
            globalMaxh=std::max(globalMaxh,data[i].maxh);
        }
        bool succeed=false;
        for(uint_fast32_t i=0;i<n;++i)
        {
            if(globalMinw==data[i].minw && globalMaxw==data[i].maxw &&
                globalMinh==data[i].minh && globalMaxh==data[i].maxh)
            {
                succeed=true;
                break;
            }
        }
        if(succeed)
            out<<"TAK\n";
        else
            out<<"NIE\n";
        delete [] data;
    }
}

} // namespace

int main(int argc, char **argv)
{
    std::ios_base::sync_with_stdio(false);
#ifdef DEBUG
    init(argc, argv);
#else
    (void)argc;
    (void)argv;
#endif
    solution();
    return 0;
}