#include <bits/stdc++.h> using namespace std; #define ll long long ll tab[1000007]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; for (int q = 0; q < t; q++) { int n; cin >> n; bool ans = true; for (int i = 0; i < n; i++) { cin >> tab[i]; } int start = 0, end = n - 1; while (tab[start] == 0ll) start++; while (tab[end] == 0ll) end--; // cout << "start = " << start << "end = " << end << "\n"; bool ones = true; for (int i = start; i <= end; i++) { if (tab[i] == 0ll) ans = false; if (tab[i] != 1ll) ones = false; } if (start == end && tab[start] > 1) { ans = false; } if (start + 1 == end && abs(tab[start] - tab[end]) > 1) { ans = false; } if (!ones && end > start + 1) { if (ans) { for (int i = start; i < end; i++) { ll d = min(tab[i], tab[i + 1]); // if (d == 0ll) ans = false; // cout << "d = " << d << "\n"; tab[i] -= d; if (i + 1 == end) tab[i + 1] -= d; else tab[i + 1] -= (d - 1); } // cout << "Krok 1\n"; // for (int i = 0; i < n; i++) { // cout << tab[i] << " "; // } // cout << "\n"; ll ile = 0ll; for (int i = start; i <= end; i++) { if (tab[i] >= 1ll && (i == start || i == end)) { ans = false; } if (tab[i] > 0ll) { ile+=tab[i]; if (ile > 2) { ans = false; } } } } } if (ans) { cout << "TAK\n"; } else { cout << "NIE\n"; } } }
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 | #include <bits/stdc++.h> using namespace std; #define ll long long ll tab[1000007]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int t; cin >> t; for (int q = 0; q < t; q++) { int n; cin >> n; bool ans = true; for (int i = 0; i < n; i++) { cin >> tab[i]; } int start = 0, end = n - 1; while (tab[start] == 0ll) start++; while (tab[end] == 0ll) end--; // cout << "start = " << start << "end = " << end << "\n"; bool ones = true; for (int i = start; i <= end; i++) { if (tab[i] == 0ll) ans = false; if (tab[i] != 1ll) ones = false; } if (start == end && tab[start] > 1) { ans = false; } if (start + 1 == end && abs(tab[start] - tab[end]) > 1) { ans = false; } if (!ones && end > start + 1) { if (ans) { for (int i = start; i < end; i++) { ll d = min(tab[i], tab[i + 1]); // if (d == 0ll) ans = false; // cout << "d = " << d << "\n"; tab[i] -= d; if (i + 1 == end) tab[i + 1] -= d; else tab[i + 1] -= (d - 1); } // cout << "Krok 1\n"; // for (int i = 0; i < n; i++) { // cout << tab[i] << " "; // } // cout << "\n"; ll ile = 0ll; for (int i = start; i <= end; i++) { if (tab[i] >= 1ll && (i == start || i == end)) { ans = false; } if (tab[i] > 0ll) { ile+=tab[i]; if (ile > 2) { ans = false; } } } } } if (ans) { cout << "TAK\n"; } else { cout << "NIE\n"; } } } |