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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
#include <cstdio>
#include <vector>

bool results[100007];

int main()
{
    int t,n;
    scanf("%d", &t);
    for(int l=0; l<t; l++)
    {
        scanf("%d", &n);
        int begin = -1;
        int end = -1;
        bool wrongTeller=false;

        std::vector<long long int> v{};
        long long int temp;
        for(int i=0; i<n; i++)
        {
            scanf("%lld", &temp);
            if(temp!=0L)
            {
                if(begin<0) begin = i;
                if(end>0) wrongTeller=true;
                v.push_back(temp);
            }
            else
            {
                if(begin>=0) end = i;
            }
        }
        if(end==-1) end=n;
        if(wrongTeller)
        {
            printf("NIE\n");
            continue;
        }
        if(wrongTeller || (end-begin == 1))
        {
            if(end-begin==1 && v[0]==1) printf("TAK\n");
            else printf("NIE\n");
            continue;
        }

        bool outerIn = false;
        bool outerOut = false;

        long long int inFromPrev=v[0];
        long long int outToPrev=v[0];
        long long int ins,outs;

        n=v.size();

        for(int i=1; i<n; i++)
        {
            ins=v[i]-inFromPrev;
            outs=v[i]-outToPrev;
            if(ins<0)
            {
                if(ins==-1 && !outerOut)
                {
                    outerOut=true;
                    ins=0;
                }
                else
                {
                    wrongTeller=true;
                    break;
                }
            }
            if(outs==0 && i<n-1)
            {
                if(!outerIn)
                {
                    outerIn=true;
                    outs=1;
                }
                else
                {
                    wrongTeller=true;
                    break;
                }
            }
            if(outs<0)
            {
                if(outs==-1 && !outerIn && i==(n-1))
                {
                    outerIn=true;
                    outs=0;
                }
                else
                {
                    wrongTeller=true;
                    break;
                }
            }
            inFromPrev = outs;
            outToPrev = ins;

        }
        if(inFromPrev > 0 )
        {
            if(!outerOut && inFromPrev==1)
            {
                outerOut=true;
            }
            else
            {
                wrongTeller=true;
            }
        }
        if(outToPrev > 0)
        {
            if(!outerIn && outToPrev==1)
            {
                outerIn=true;
            }
            else
            {
                wrongTeller=true;
            }
        }
        if(wrongTeller || (outerIn && !outerOut) || (!outerIn && outerOut))
        {
            printf("NIE\n");
        }
        else
        {
            printf("TAK\n");
        }
    }
    
    return 0;
}