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
#include <bits/stdc++.h>

using namespace std;

int a[2][1000100];

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

    int t;
    cin >> t;
    while(t--) {
        int n;
        cin >> n;

        a[0][0] = 0;
        a[0][n + 1] = 0;
        a[1][0] = 0;
        a[1][n + 1] = 0;
        for(int i = 1; i <= n; i++) {
            cin >> a[0][i];
            a[1][i] = a[0][i];
        }

        int b;
        for(b = 1; b <= n; b++) {
            if(a[0][b] != 0) {
                break;
            }
        }
        int ps[] = {b, b + 1};

        bool flag = false;
        for(int x = 0; !flag and x < 2; x++) {
            int p = ps[x];
            while(p <= n) {
                int i;
                if(a[x][p - 1]) {
                    i = p - 1;
                } else if(a[x][p + 1]) {
                    i = p + 1;
                } else {
                    break;
                }

                int d = max(0, min(a[x][p], a[x][i]));
                a[x][p] -= d;
                a[x][i] -= (d - 1);

                p = i;
            }

            int ones = 0;
            int others = 0;
            for(int i = 0; i <= n + 1; i++) {
                if(a[x][i] == 1) {
                    ones++;
                    continue;
                }
                if(a[x][i] != 0) {
                    others++;
                    break;
                }
            }
            if(ones == 1 and others == 0) {
                flag = true;
                break;
            }
        }

        cout << (flag ? "TAK" : "NIE") << "\n";
    }

    return 0;
}