//Sylwia Sapkowska #include <bits/stdc++.h> #pragma GCC optimize("O3", "unroll-loops") using namespace std; void __print(int x) {cerr << x;} void __print(long long x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << "'" << x << "'";} void __print(const char *x) {cerr << '"' << x << '"';} void __print(const string &x) {cerr << '"' << x << '"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef LOCAL #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else #define debug(x...) #endif #define int long long typedef pair<int, int> T; const int oo = 1e18, oo2 = 1e9+7, K = 30; const int mod = 998244353; void solve(){ int n; cin >> n; vector<int>a(n+1); int odd = 0, even = 0; int mx = 1; for (int i = 1; i<=n; i++) { cin >> a[i]; if (i&1) odd += a[i]; else even += a[i]; if (a[i] > a[mx]) mx = i; } if (abs(odd-even) >= 2) { cout << "NIE\n"; return; } assert(*max_element(a.begin(), a.end()) > 0); int L = 1, R = n; while (!a[L]) L++; while (!a[R]) R--; vector<int>c = {0}; for (int i = L; i <= R; i++) c.emplace_back(a[i]); c.swap(a); n = (int)a.size()-1; //niespojne for (int i = 1; i<=n; i++){ if (!a[i]){ cout << "NIE\n"; return; } } debug(n, a); if (n == 1){ cout << (a[1] == 1 ? "TAK\n" : "NIE\n"); return; } if (n == 2){ cout << "TAK\n"; return; } // n >= 3 auto check = [&](){ auto b = a; int pref = -1; for (int i = 1; i<n; i++){ if (b[i] == b[i+1]){ b[i] = 0; b[i+1] = 0; i++; continue; } if (b[i] < b[i+1]){ b[i+1] -= (b[i]-1); b[i] = 0; continue; } //a[i] > a[i+1] int d = b[i] - b[i+1]; if (d > 2) return false; if (d == 2){ pref = i; break; } else { if (i+2 <= n) { pref = i; break; } else { b[i] = 0; b[i+1] = 0; } } } // debug(b); if (pref == -1) return b[n] <= 1; // debug(b, pref); b = a; for (int i = 2; i<=pref; i++) b[i]--; // debug(b); for (int i = 1; i<n; i++){ if (b[i] == b[i+1]){ b[i] = 0; b[i+1] = 0; i++; continue; } if (b[i] < b[i+1]){ b[i+1] -= (b[i]-1); b[i] = 0; continue; } //a[i] > a[i+1] int d = b[i] - b[i+1]; if (d >= 2) return false; if (i+2 <= n) return false; else b[i] = b[i+1] = 0; } //nie doskocze return b[n] <= 1; }; for (int rep = 0; rep < 2; rep++){ if (check()){ cout << "TAK\n"; return; } reverse(a.begin()+1, a.end()); } cout << "NIE\n"; } int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; cin >> t; while (t--) solve(); return 0; }
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 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 | //Sylwia Sapkowska #include <bits/stdc++.h> #pragma GCC optimize("O3", "unroll-loops") using namespace std; void __print(int x) {cerr << x;} void __print(long long x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << "'" << x << "'";} void __print(const char *x) {cerr << '"' << x << '"';} void __print(const string &x) {cerr << '"' << x << '"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef LOCAL #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else #define debug(x...) #endif #define int long long typedef pair<int, int> T; const int oo = 1e18, oo2 = 1e9+7, K = 30; const int mod = 998244353; void solve(){ int n; cin >> n; vector<int>a(n+1); int odd = 0, even = 0; int mx = 1; for (int i = 1; i<=n; i++) { cin >> a[i]; if (i&1) odd += a[i]; else even += a[i]; if (a[i] > a[mx]) mx = i; } if (abs(odd-even) >= 2) { cout << "NIE\n"; return; } assert(*max_element(a.begin(), a.end()) > 0); int L = 1, R = n; while (!a[L]) L++; while (!a[R]) R--; vector<int>c = {0}; for (int i = L; i <= R; i++) c.emplace_back(a[i]); c.swap(a); n = (int)a.size()-1; //niespojne for (int i = 1; i<=n; i++){ if (!a[i]){ cout << "NIE\n"; return; } } debug(n, a); if (n == 1){ cout << (a[1] == 1 ? "TAK\n" : "NIE\n"); return; } if (n == 2){ cout << "TAK\n"; return; } // n >= 3 auto check = [&](){ auto b = a; int pref = -1; for (int i = 1; i<n; i++){ if (b[i] == b[i+1]){ b[i] = 0; b[i+1] = 0; i++; continue; } if (b[i] < b[i+1]){ b[i+1] -= (b[i]-1); b[i] = 0; continue; } //a[i] > a[i+1] int d = b[i] - b[i+1]; if (d > 2) return false; if (d == 2){ pref = i; break; } else { if (i+2 <= n) { pref = i; break; } else { b[i] = 0; b[i+1] = 0; } } } // debug(b); if (pref == -1) return b[n] <= 1; // debug(b, pref); b = a; for (int i = 2; i<=pref; i++) b[i]--; // debug(b); for (int i = 1; i<n; i++){ if (b[i] == b[i+1]){ b[i] = 0; b[i+1] = 0; i++; continue; } if (b[i] < b[i+1]){ b[i+1] -= (b[i]-1); b[i] = 0; continue; } //a[i] > a[i+1] int d = b[i] - b[i+1]; if (d >= 2) return false; if (i+2 <= n) return false; else b[i] = b[i+1] = 0; } //nie doskocze return b[n] <= 1; }; for (int rep = 0; rep < 2; rep++){ if (check()){ cout << "TAK\n"; return; } reverse(a.begin()+1, a.end()); } cout << "NIE\n"; } int32_t main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int t = 1; cin >> t; while (t--) solve(); return 0; } |