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

constexpr int32_t MAX_N = 1000000;
std::vector<int32_t> a(MAX_N), b(MAX_N);

void go() {
    int32_t n;
    std::cin >> n;

    for (int32_t i = 0; i < n; ++i) {
        std::cin >> a[i];
    }
    for (int32_t i = 0; i < n; ++i) {
        b[i] = a[i];
    }

    int32_t first = 0;
    while (a[first] == 0) {
        first += 1;
    }

    for (int32_t i = first; ; ++i) {
        if (i + 1 == n) {
            if (a[i] > 0) {
                a[i] -= 1;
            }
            break;
        }
        int32_t d = std::min(a[i], a[i + 1]);
        if (a[i] > a[i + 1]) {
            a[i] -= d + 1;
            a[i + 1] -= d;
            break;
        }
        if (d == 0) {
            break;
        }
        a[i] -= d;
        a[i + 1] -= d - 1;
    }

    if (first + 1 < n && b[first + 1] > 0) {
        b[first + 1] -= 1;
        for (int32_t i = first; ; ++i) {
            if (i + 1 == n) {
                if (b[i] > 0) {
                    b[i] -= 1;
                }
                break;
            }
            int32_t d = std::min(b[i], b[i + 1]);
            if (b[i] > b[i + 1]) {
                b[i] -= d + 1;
                b[i + 1] -= d;
                break;
            }
            if (d == 0) {
                break;
            }
            b[i] -= d;
            b[i + 1] -= d - 1;
        }
    }

    bool ok_a = true, ok_b = true;
    for (int32_t i = 0; i < n; ++i) {
        ok_a &= a[i] == 0;
        ok_b &= b[i] == 0;
    }
    std::cout << (ok_a || ok_b ? "TAK" : "NIE") << "\n";
}

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int32_t t;
    std::cin >> t;

    for (int32_t i = 0; i < t; ++i) {
        go();
    }
}