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
#include <iostream>

using namespace std;

int main()
{
    int tempLiters, tempCurrent, tempTarget, cases, number;
    int minimumCurrent, maximumCurrent, minimumTarget, maximumTarget;
    long long int sumCurrent, sumTarget;
    cin >> cases;
    for(int i = 0; i < cases; i++)
    {
        maximumCurrent = 0;
        maximumTarget = 0;
        minimumCurrent = 2000000;
        minimumTarget = 2000000;
        sumCurrent = 0;
        sumTarget = 0;
        cin >> number;
        for(int j = 0; j < number; j++)
        {
            cin >> tempLiters >> tempCurrent >> tempTarget;
            if(tempCurrent > maximumCurrent)
            {
                maximumCurrent = tempCurrent;
            }
            if(tempCurrent < minimumCurrent)
            {
                minimumCurrent = tempCurrent;
            }
            if(tempTarget > maximumTarget)
            {
                maximumTarget = tempTarget;
            }
            if(tempTarget < minimumTarget)
            {
                minimumTarget = tempTarget;
            }
            sumCurrent += tempLiters * tempCurrent;
            sumTarget += tempLiters * tempTarget;
        }
        if(minimumCurrent > minimumTarget || maximumCurrent < maximumTarget || sumCurrent != sumTarget)
        {
            cout << "NIE" << endl;
        }
        else
        {
            cout << "TAK" << endl;
        }
    }
    return 0;
}