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
102
103
104
105
106
107
108
109
110
#include <iostream>
#include <string>
#include <vector>

using namespace std;

string solve(int n, vector<int>& a)
{
    int l = 0;

    for (; l < n; ++l)
    {
        if (a[l] != 0)
            break;
    }

    int r = l;

    for (; r < n; ++r)
    {
        if (a[r] == 0)
            break;
    }

    for (int i = r; i < n; ++i)
    {
        if (a[i] != 0)
            return "NIE";
    }

    while (true)
    {
        if (r - l == 1)
            return (a[l] == 1 ? "TAK" : "NIE");

        if (r - l == 2)
            return (abs(a[l + 1] - a[l]) <= 1 ? "TAK" : "NIE");

        if (a[l] > a[l + 1])
            return "NIE";

        if (a[r - 1] > a[r - 2])
            return "NIE";

        if (a[l] < a[l + 1])
        {
            a[l + 1] -= a[l];
            ++l;
        }
        else if (a[r - 1] < a[r - 2])
        {
            a[r - 2] -= a[r - 1];
            --r;
        }
        else if (a[l] != 1)
        {
            a[l] = 1;
            a[l + 1] = 1;
        }
        else if (a[r - 1] != 1)
        {
            a[r - 1] = 1;
            a[r - 2] = 1;
        }
        else if (a[l + 2] == 1)
        {
            ++l;
        }
        else if (a[r - 3] == 1)
        {
            --r;
        }
        else if (a[l + 2] > a[l + 3])
        {
            return "NIE";
        }
        else
        {
            a[l + 3] -= a[l + 2] - 1;
            a[l + 2] = 1;
            ++l;
        }
    }

    return "?";
}

int main()
{
    int t, n;
    cin >> t;

    for (int i = 0; i < t; ++i)
    {
        cin >> n;

        vector<int> a(n);

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

        string res = solve(n, a);

        cout << res << endl;
    }

    return 0;
}