#include <bits/stdc++.h> using namespace std; #define fwd(i, a, n) for (int i = (a); i < (n); i++) #define rep(i, n) fwd(i, 0, n) #define all(X) X.begin(), X.end() #define sz(X) int(size(X)) #define pb push_back #define eb emplace_back #define st first #define nd second using pii = pair<int, int>; using vi = vector<int>; using ll = long long; using ld = long double; #ifdef LOC auto SS = signal(6, [](int) { *(int *)0 = 0; }); # define DTP(x, y) \ auto operator<<(auto &o, auto a)->decltype(y, o) { \ o << "("; \ x; \ return o << ")"; \ } DTP(o << a.st << ", " << a.nd, a.nd); DTP(for (auto i : a) o << i << ", ", all(a)); void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; } # define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x) #else # define deb(...) 0 #endif #define GOOD "TAK\n" #define BAD "NIE\n" vi read_arr() { int n; cin >> n; vi a(n); rep(i, n) cin >> a[i]; while (a.back() == 0) a.pop_back(); reverse(all(a)); while (a.back() == 0) a.pop_back(); return a; } void sol() { vi a = read_arr(); if (sz(a) == 1) { if (a[0] == 1) cout << GOOD; else cout << BAD; return; } if (*min_element(all(a)) == 0) { cout << BAD; return; } vector<ll> magic(sz(a)); magic[0] = a[0]; fwd(i, 1, sz(a)) magic[i] = a[i] - magic[i - 1]; ll final_magic = magic.back(); magic.pop_back(); ll min_magic = *min_element(all(magic)); if (llabs(final_magic) > 1ll || min_magic < 0) { cout << BAD; return; } if (min_magic > 0) { if (final_magic == 0) { cout << GOOD; } else if (final_magic == -1) { cout << GOOD; } else { if (sz(a) == 1) { cout << BAD; } else { cout << GOOD; } } return; } int first_zero = sz(magic), last_zero = -1; rep(i, sz(magic)) { if (magic[i] == 0) { first_zero = min(first_zero, i); last_zero = max(last_zero, i); } } if (first_zero == 0) { cout << BAD; return; } if (llabs(final_magic) == 1) { ll delta = -1; fwd(i, first_zero - 1, sz(magic)) { if (delta + magic[i] < 0) { cout << BAD; return; } delta = -delta; } if (delta + final_magic != 0) { cout << BAD; } else { cout << GOOD; } return; } ll delta = -1; fwd(i, first_zero - 1, last_zero + 1) { if (delta + magic[i] < 0) { cout << BAD; return; } delta = -delta; } cout << GOOD; } int32_t main() { cin.tie(0)->sync_with_stdio(0); cout << fixed << setprecision(10); int t; cin >> t; rep(i, t) sol(); #ifdef LOCF cout.flush(); cerr << "- - - - - - - - -\n"; (void)!system( "grep VmPeak /proc/$PPID/status | sed s/....kB/\' MB\'/1 >&2"); // 4x.kB // ....kB #endif }
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 | #include <bits/stdc++.h> using namespace std; #define fwd(i, a, n) for (int i = (a); i < (n); i++) #define rep(i, n) fwd(i, 0, n) #define all(X) X.begin(), X.end() #define sz(X) int(size(X)) #define pb push_back #define eb emplace_back #define st first #define nd second using pii = pair<int, int>; using vi = vector<int>; using ll = long long; using ld = long double; #ifdef LOC auto SS = signal(6, [](int) { *(int *)0 = 0; }); # define DTP(x, y) \ auto operator<<(auto &o, auto a)->decltype(y, o) { \ o << "("; \ x; \ return o << ")"; \ } DTP(o << a.st << ", " << a.nd, a.nd); DTP(for (auto i : a) o << i << ", ", all(a)); void dump(auto... x) { ((cerr << x << ", "), ...) << '\n'; } # define deb(x...) cerr << setw(4) << __LINE__ << ":[" #x "]: ", dump(x) #else # define deb(...) 0 #endif #define GOOD "TAK\n" #define BAD "NIE\n" vi read_arr() { int n; cin >> n; vi a(n); rep(i, n) cin >> a[i]; while (a.back() == 0) a.pop_back(); reverse(all(a)); while (a.back() == 0) a.pop_back(); return a; } void sol() { vi a = read_arr(); if (sz(a) == 1) { if (a[0] == 1) cout << GOOD; else cout << BAD; return; } if (*min_element(all(a)) == 0) { cout << BAD; return; } vector<ll> magic(sz(a)); magic[0] = a[0]; fwd(i, 1, sz(a)) magic[i] = a[i] - magic[i - 1]; ll final_magic = magic.back(); magic.pop_back(); ll min_magic = *min_element(all(magic)); if (llabs(final_magic) > 1ll || min_magic < 0) { cout << BAD; return; } if (min_magic > 0) { if (final_magic == 0) { cout << GOOD; } else if (final_magic == -1) { cout << GOOD; } else { if (sz(a) == 1) { cout << BAD; } else { cout << GOOD; } } return; } int first_zero = sz(magic), last_zero = -1; rep(i, sz(magic)) { if (magic[i] == 0) { first_zero = min(first_zero, i); last_zero = max(last_zero, i); } } if (first_zero == 0) { cout << BAD; return; } if (llabs(final_magic) == 1) { ll delta = -1; fwd(i, first_zero - 1, sz(magic)) { if (delta + magic[i] < 0) { cout << BAD; return; } delta = -delta; } if (delta + final_magic != 0) { cout << BAD; } else { cout << GOOD; } return; } ll delta = -1; fwd(i, first_zero - 1, last_zero + 1) { if (delta + magic[i] < 0) { cout << BAD; return; } delta = -delta; } cout << GOOD; } int32_t main() { cin.tie(0)->sync_with_stdio(0); cout << fixed << setprecision(10); int t; cin >> t; rep(i, t) sol(); #ifdef LOCF cout.flush(); cerr << "- - - - - - - - -\n"; (void)!system( "grep VmPeak /proc/$PPID/status | sed s/....kB/\' MB\'/1 >&2"); // 4x.kB // ....kB #endif } |