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
#include <iostream>
#include <vector>

using namespace std;

bool solve(vector<int> vec, int ptr);

int main()
{
    cin.tie(0)->sync_with_stdio(0);
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        vector<int> vec(n+10);
        for(int i=5; i<n+5; i++)
            cin>>vec[i];
        int st = -1;
        for(int i=5; st == -1; i++)
            if(vec[i] != 0)
                st = i;
//        cout<<st<<"\n";
//        for(int i=0; i<n+10; i++)
//            cout<<vec[i]<<" ";
//        cout<<"\n";

        if(solve(vec, st-1) || solve(vec, st))
            cout<<"TAK\n";
        else
            cout<<"NIE\n";
    }
}

bool solve(vector<int> vec, int ptr)
{
    while(1)
    {
        if(vec[ptr] == 0)
        {
            if(vec[ptr+1] == 0)
                break;
            if(vec[ptr+1] > vec[ptr+2])
            {
                vec[ptr+1] = vec[ptr+1] - vec[ptr+2] - 1;
                vec[ptr+2] = 0;
                break;
            }
            vec[ptr+2] -= vec[ptr+1];
            vec[ptr+1] = 0;
            ptr += 2;
        }
        else
        {
            int m = min(vec[ptr], vec[ptr+1]);
            if(m == 0)
                return 0;
            vec[ptr] -= m;
            vec[ptr+1] -= m;
        }
    }
    bool z = 1;
    for(auto x : vec)
        z &= (x == 0);
    return z;
}