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
#include <cstdio>
#include <vector>
#include <utility>
#include <cmath>
#include <algorithm>

using ll = long long;

using namespace std;

int main() { 
    int t;
    scanf("%d", &t);
    while (t--) {
        int n;
        scanf("%d", &n);
        vector<int> a(n);
        
        for (int i = 0; i < n; i++) { 
            scanf("%d", &a[i]);
        }

        int start = 0;
        while (a[start] == 0) {
            start++;
        }

        int left_lvl = start;
        int right_cnt = a[start];
        start++;

        for (int i = start; i < n; i++) {

            if (right_cnt == 0) {
                if (a[i] > 0) {
                    right_cnt = 2; // bad
                    break;
                } else {
                    continue;
                }
            }

            if (a[i] < right_cnt - 1) {
                break;
            }

            a[i] -= right_cnt - 1;
            if (a[i] >= 2 && left_lvl == i - 1) {
                left_lvl = i;
                a[i]--;
            }
            right_cnt = a[i];
        }

        if (right_cnt > 1) {
            printf("NIE\n");
        } else {
            printf("TAK\n");
        }
    }

}


// g++ -std=c++17 -Wall -Wextra -Wshadow B.cpp -o B