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
136
137
138
#include <bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cerr.tie(0);
    int t;
    cin>>t;
    for(int u = 0;u<t;u++)
    {
        int n;
        cin>>n;
        vector<int> a(n);
        for(int i =0 ;i<n;i++)

        {
            cin>>a[i];
        }
        bool za =false;
        pair<bool,bool> d;
        vector<int> b;
        for(int i = 0;i<n;i++)
        {
            if(a[i] != 0 && d.second)
            {
                za = true;
                cout<<"NIE\n";
                break;
            }
            else if(a[i] != 0)
            {
                d.first = true;
                b.push_back(a[i]);
            }
            else if(d.first)
            {
                d.second = true;
            }
        }
        if(za) continue;
        long long p = 0;
        long long np = 0;
        n = b.size();
        vector<long long> v(n);
        for(int i =0 ;i<n;i++)
        {
            if(i%2 == 0)
            {
                p+=b[i];
            }
            else
            {
                np+=b[i];
            }
            if(i == 0)
            {
                v[i] = b[i];
            }
            else
            {
                v[i] = v[i-1]*-1 + b[i];
            }
        }
        za =false;
        for(int i =0 ;i<n-1;i++)
        {
            if(v[i] < 0)
            {
                cout<<"NIE\n";
                za = true;
                break;
            }
        }
        if(za) continue;
        if(p == np)
        {
            bool w[2];
            w[0] = 1;
            w[1] = 1;
            for(int i = 0;i<n-1;i++)
            {
                if(v[i] <= 0)
                {
                    w[i%2] = false;
                }
            }
            if(w[0] || w[1])
            {
                cout<<"TAK\n";
            }
            else
            {
                cout<<"NIE\n";
            }
        }
        else if(p+1 == np)
        {
            bool za = true;
            for(int i =0 ;i<n-1;i++)
            {
                if(v[i] + 1 -i%2 <= 0)
                {
                    cout<<"NIE\n";
                    za = false;
                    break;
                }
            }
            if(za)
            {
                cout<<"TAK\n";
            }
        }
        else if(p == np+1)
        {
            bool za = true;
            for(int i = 0;i<n-1;i++)
            {
                if(v[i]+i%2 <= 0)
                {
                    cout<<"NIE\n";
                    za = false;
                    break;
                }
            }
            if(za)
            {
                cout<<"TAK\n";
            }
        }
        else
        {
            cout<<"NIE\n";
        }

    }
}