#include <bits/stdc++.h> #define debug(x) cout<<#x<<" = "<<x<<"\n" #define pb push_back #define ins insert #define fi first #define se second using namespace std; using ull = unsigned long long; using ll = long long; using ld = long double; template <typename H, typename T> ostream& operator<<(ostream& os, pair<H, T> m){ return os <<"("<< m.fi<<", "<<m.se<<")"; } template <typename H> ostream& operator<<(ostream& os, vector<H> V){ os<<"{"; for(int i=0; i<V.size(); i++){ if(i)os<<" "; os<<V[i]; } os<<"}"; return os; } void solve(); int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; cin>>t; while(t--) solve(); return 0; } int tab[1000000+50]; void solve(){ int n; cin>>n; //sprawdzic : spojnosc / poprawnosc bool ok = true; tab[0] = 0; tab[n+1] = 0; for(int i = 1; i <= n; i++) cin>>tab[i]; int last,fist; for(int i = n; i>= 1; i--){ if(tab[i] != 0){ last = i; break; } } for(int i = 1; i<= n; i++){ if(tab[i] != 0){ fist = i; break; } } for(int i = fist; i <= last; i++) if(tab[i] == 0) ok = false; if(!ok){ cout<<"NIE\n"; return; } int madacabra = 2; //?????? nalezy oszczedzac!!!!! int acti = 0; int wszy = 0; for(int i = fist; i <= last; i++){ //? last +1 czy last???? wszy = acti; if(tab[i] > wszy){ //dostawic V-y int nowe = tab[i] - wszy; acti += 2*nowe; if(i == last){ madacabra-=acti; } }else{ //dostawic // ^-y ewentualnie poprzecinac za pomoca madacabry int M = 0; int likw = acti/2; if(likw >= wszy-tab[i]){ likw = wszy-tab[i]; wszy -= likw; acti -= 2*likw; while(acti == 0 && i != last && madacabra >= 0){ madacabra--; acti++; } while(acti > 0 && i == last && madacabra >= 0){ madacabra--; acti--; } }else{ //debug(i); if(acti % 2 == 0){ if(tab[i] < acti/2-1) madacabra = -1; madacabra-=2; if(i != last) madacabra = -1;//niedobra }else{ if(tab[i] < acti/2) madacabra = -1; if(i == last){ madacabra--; }else{ madacabra-=2; acti = 1; } } } //if(acti < 0) madacabra+=acti; chyba zle } } /*debug(fist); debug(last); debug(madacabra);*/ // debug(madacabra); if(madacabra >= 0) 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 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 | #include <bits/stdc++.h> #define debug(x) cout<<#x<<" = "<<x<<"\n" #define pb push_back #define ins insert #define fi first #define se second using namespace std; using ull = unsigned long long; using ll = long long; using ld = long double; template <typename H, typename T> ostream& operator<<(ostream& os, pair<H, T> m){ return os <<"("<< m.fi<<", "<<m.se<<")"; } template <typename H> ostream& operator<<(ostream& os, vector<H> V){ os<<"{"; for(int i=0; i<V.size(); i++){ if(i)os<<" "; os<<V[i]; } os<<"}"; return os; } void solve(); int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int t = 1; cin>>t; while(t--) solve(); return 0; } int tab[1000000+50]; void solve(){ int n; cin>>n; //sprawdzic : spojnosc / poprawnosc bool ok = true; tab[0] = 0; tab[n+1] = 0; for(int i = 1; i <= n; i++) cin>>tab[i]; int last,fist; for(int i = n; i>= 1; i--){ if(tab[i] != 0){ last = i; break; } } for(int i = 1; i<= n; i++){ if(tab[i] != 0){ fist = i; break; } } for(int i = fist; i <= last; i++) if(tab[i] == 0) ok = false; if(!ok){ cout<<"NIE\n"; return; } int madacabra = 2; //?????? nalezy oszczedzac!!!!! int acti = 0; int wszy = 0; for(int i = fist; i <= last; i++){ //? last +1 czy last???? wszy = acti; if(tab[i] > wszy){ //dostawic V-y int nowe = tab[i] - wszy; acti += 2*nowe; if(i == last){ madacabra-=acti; } }else{ //dostawic // ^-y ewentualnie poprzecinac za pomoca madacabry int M = 0; int likw = acti/2; if(likw >= wszy-tab[i]){ likw = wszy-tab[i]; wszy -= likw; acti -= 2*likw; while(acti == 0 && i != last && madacabra >= 0){ madacabra--; acti++; } while(acti > 0 && i == last && madacabra >= 0){ madacabra--; acti--; } }else{ //debug(i); if(acti % 2 == 0){ if(tab[i] < acti/2-1) madacabra = -1; madacabra-=2; if(i != last) madacabra = -1;//niedobra }else{ if(tab[i] < acti/2) madacabra = -1; if(i == last){ madacabra--; }else{ madacabra-=2; acti = 1; } } } //if(acti < 0) madacabra+=acti; chyba zle } } /*debug(fist); debug(last); debug(madacabra);*/ // debug(madacabra); if(madacabra >= 0) cout<<"TAK\n"; else cout<<"NIE\n"; } |