/* * Opis: Główny nagłówek */ #include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r)for(int i=(l);i<=(r);++i) #define REP(i,n)FOR(i,0,(n)-1) #define ssize(x)int(x.size()) #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif bool init_check(int& n, vector<int>& arr) { int l = 0, r = n-1; while (arr[l] == 0) { l++; } while (arr[r] == 0) { r--; } vector<int> temp; FOR(i, l, r) { temp.push_back(arr[i]); } n = r - l + 1; swap(temp, arr); REP(i, n) { if (arr[i] == 0) { return false; } } return true; } void solve() { int n; cin >> n; vector<int> arr(n); for (int& v : arr) { cin >> v; } if (!init_check(n, arr)) { cout << "NIE\n"; return; } array<unordered_set<int>, 3> curr, prev; prev[0].insert(0); int cnt = 0; for (int w : arr) { cnt++; debug("before opening", w); REP(i, 3) { debug(prev[i]); } for (int inp : prev[0]) { if (w > inp) { prev[1].insert(inp + 1); } } for (int inp : prev[1]) { if (w > inp) { prev[2].insert(inp + 1); } } debug("before next stage"); REP(i, 3) { debug(prev[i]); } REP(i, 3) { for (int inp : prev[i]) { if (w >= inp) { curr[i].insert(inp + 2*(w - inp)); } else { if (2*(inp - w) > inp) { continue; } curr[i].insert(inp - 2*(inp - w)); } } } debug("before closing"); REP(i, 3) { debug(curr[i]); } for (int inp : curr[0]) { if (inp > 0) { curr[1].insert(inp - 1); } } for (int inp : curr[1]) { if (inp > 0) { curr[2].insert(inp - 1); } } if (cnt < n) { REP(i, 3) { curr[i].erase(0); } } debug("finishing"); REP(i, 3) { debug(curr[i]); } debug("---------------------"); swap(curr, prev); REP(i, 3) { curr[i].clear(); } } if (prev[2].find(0) != prev[2].end()) { cout << "TAK\n"; } else { cout << "NIE\n"; } } int main() { cin.tie(0)->sync_with_stdio(0); int t; cin >> t; while (t--) { solve(); } }
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 | /* * Opis: Główny nagłówek */ #include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r)for(int i=(l);i<=(r);++i) #define REP(i,n)FOR(i,0,(n)-1) #define ssize(x)int(x.size()) #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif bool init_check(int& n, vector<int>& arr) { int l = 0, r = n-1; while (arr[l] == 0) { l++; } while (arr[r] == 0) { r--; } vector<int> temp; FOR(i, l, r) { temp.push_back(arr[i]); } n = r - l + 1; swap(temp, arr); REP(i, n) { if (arr[i] == 0) { return false; } } return true; } void solve() { int n; cin >> n; vector<int> arr(n); for (int& v : arr) { cin >> v; } if (!init_check(n, arr)) { cout << "NIE\n"; return; } array<unordered_set<int>, 3> curr, prev; prev[0].insert(0); int cnt = 0; for (int w : arr) { cnt++; debug("before opening", w); REP(i, 3) { debug(prev[i]); } for (int inp : prev[0]) { if (w > inp) { prev[1].insert(inp + 1); } } for (int inp : prev[1]) { if (w > inp) { prev[2].insert(inp + 1); } } debug("before next stage"); REP(i, 3) { debug(prev[i]); } REP(i, 3) { for (int inp : prev[i]) { if (w >= inp) { curr[i].insert(inp + 2*(w - inp)); } else { if (2*(inp - w) > inp) { continue; } curr[i].insert(inp - 2*(inp - w)); } } } debug("before closing"); REP(i, 3) { debug(curr[i]); } for (int inp : curr[0]) { if (inp > 0) { curr[1].insert(inp - 1); } } for (int inp : curr[1]) { if (inp > 0) { curr[2].insert(inp - 1); } } if (cnt < n) { REP(i, 3) { curr[i].erase(0); } } debug("finishing"); REP(i, 3) { debug(curr[i]); } debug("---------------------"); swap(curr, prev); REP(i, 3) { curr[i].clear(); } } if (prev[2].find(0) != prev[2].end()) { cout << "TAK\n"; } else { cout << "NIE\n"; } } int main() { cin.tie(0)->sync_with_stdio(0); int t; cin >> t; while (t--) { solve(); } } |