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

using namespace std;

#define ALL(x) (x).begin(), (x).end()

template<class C> void mini(C &a5, C b5) { a5 = min(a5, b5); }
template<class C> void maxi(C &a5, C b5) { a5 = max(a5, b5); }

#ifdef LOCAL
const bool debug = true;
#else
const bool debug = false;
#define cerr if (true) {} else cout
#endif
// clang-format on

#define int long long
#define double long double

const int INF = 1e18;
const int mod = 1e9 + 7;

bool solve() { // todo: spójność
    int n;
    cin >> n;
    vector<int> v;
    v.push_back(0);
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        v.push_back(x);
    }
    v.push_back(0);

    int state = 0;
    for (int x : v) {
        if (x > 0) {
            if (state == 2) return false;
            state = 1;
        } else {
            if (state == 1)
                state = 2;
        }
    }

    state = 0;
    int previous = 0;
    // v[i] - nie przyporządkowane jeszcze
    for (int i = 1; i <= n; i++) {
        v[i - 1] = 0;
        // cout << "state=" << state << "    ";
        // for (int x : v) cout << " " << x;
        // cout << endl;

        if (v[i] == 0) continue;

        if (v[i] < v[i + 1]) {
            v[i + 1] -= v[i] - (state == 1);
            continue;
        }

        if (v[i] == v[i + 1]) {
            if (state == 2) return false;
            state = 1;
            v[i + 1] -= v[i] - 1;
            continue;
        }

        if (v[i] == v[i + 1] + 1) {
            if (state == 2) return false;
            state = 2;
            v[i + 1] = 0;
            continue;
        }

        return false;
    }

    return true;
}

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

    int t;
    cin >> t;
    while (t--) {
        if (solve()) {
            cout << "TAK\n";
        } else {
            cout << "NIE\n";
        }
    }

    return 0;
} /*

 */