/* Dejwo to ziomal ®© */ #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector <ll> vi; typedef pair <ll, ll> pi; typedef vector < pair < ll,ll > > vpi; #define pb push_back #define FOR0(n) for(int i = 0; i < n; i++) #define FOR0j(n) for(int j = 0; j < n; j++) #define FOR1(n) for(int i = 1; i <= n; i++) #define FOR1j(n) for(int j = 1; j <= n; j++) #define FOR_REV(n) for(int i = n - 1; i >= 0 ; i--) #define FOR_REVj(n) for(int j = n - 1; j >= 0 ; j--) #define SIZE 200042 #define MAX 1e6 + 42 const int P = 29; char arr[ 6 ]; int hashed[ 400000 ]; //ll big_prime = 18446744069414584321; int letter_pos( char a){ if( a == '0' ) return 0; return (a - 96); } int hashing(){ int a = letter_pos( arr[ 5 ] ); int b = letter_pos( arr[ 4 ] ); int c = letter_pos( arr[ 3 ] ); int d = letter_pos( arr[ 2 ] ); int e = letter_pos( arr[ 1 ] ); int f = letter_pos( arr[ 0 ] ); return ((((a * P + b) * P + c) * P + d) * P + e) * P + f; } void clear(){ FOR0( 6 ) arr[ i ] = '0'; } queue <int> FRONT, BACK; void de_hash_front(int h){ while (h) { FRONT.push( h % P ) ; h /= P; } } void de_hash_back(int h){ stack < int > S; while (h) { S.push( h % P); h /= P; } while (!S.empty()) { int f = S.top(); S.pop(); BACK.push( f ); } } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); // 33 554 432 bitow pamieci // 4 194 304 bajtow // mao int n; cin >> n; vi rest; clear(); char c; int cnt = 0; int hsh_ptr = 0; while ( cin >> c) { arr[ cnt ] = c; cnt ++; if ( cnt == 6) { cnt = 0; hashed[ hsh_ptr ++ ] = hashing(); clear(); } //cout << c << " "; }//cout << endl; int diff = 0; FOR0(6)if( arr[ i ] != '0') diff ++; if( diff ) hashed[ hsh_ptr ++ ] = hashing(); //cout << "na ostatnim zostalo: " << diff << " miejsce: " << hsh_ptr << endl; // FOR0(hsh_ptr) cout << hashed [ i ] << " "; // cout << endl << endl; int last = hashed[ hsh_ptr - 1]; de_hash_back( last ); int p = 0; int k = hsh_ptr - 2; if( diff == 0) k ++; while ( p <= k ) { de_hash_front( hashed[ p ]); de_hash_back( hashed[ k ]); p ++; k --; while (!FRONT.empty() and !BACK.empty()) { int f = FRONT.front(); int b = BACK.front(); FRONT.pop(); BACK.pop(); // cout << f << " " << b << endl; if( f != b){ cout << "NIE\n"; return 0; } } } //cout << "Queues sizes: " << FRONT.size() << " " << BACK.size() << endl; while (!BACK.empty()) { int r = BACK.front(); BACK.pop(); rest.pb( r ); } p = 0; k = (int)rest.size() - 1; while (p < k) { if( rest[ p ] != rest[ k ]){ cout << "NIE\n"; return 0; } p ++; k --; } cout << "TAK\n"; 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 154 155 156 157 158 159 | /* Dejwo to ziomal ®© */ #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector <ll> vi; typedef pair <ll, ll> pi; typedef vector < pair < ll,ll > > vpi; #define pb push_back #define FOR0(n) for(int i = 0; i < n; i++) #define FOR0j(n) for(int j = 0; j < n; j++) #define FOR1(n) for(int i = 1; i <= n; i++) #define FOR1j(n) for(int j = 1; j <= n; j++) #define FOR_REV(n) for(int i = n - 1; i >= 0 ; i--) #define FOR_REVj(n) for(int j = n - 1; j >= 0 ; j--) #define SIZE 200042 #define MAX 1e6 + 42 const int P = 29; char arr[ 6 ]; int hashed[ 400000 ]; //ll big_prime = 18446744069414584321; int letter_pos( char a){ if( a == '0' ) return 0; return (a - 96); } int hashing(){ int a = letter_pos( arr[ 5 ] ); int b = letter_pos( arr[ 4 ] ); int c = letter_pos( arr[ 3 ] ); int d = letter_pos( arr[ 2 ] ); int e = letter_pos( arr[ 1 ] ); int f = letter_pos( arr[ 0 ] ); return ((((a * P + b) * P + c) * P + d) * P + e) * P + f; } void clear(){ FOR0( 6 ) arr[ i ] = '0'; } queue <int> FRONT, BACK; void de_hash_front(int h){ while (h) { FRONT.push( h % P ) ; h /= P; } } void de_hash_back(int h){ stack < int > S; while (h) { S.push( h % P); h /= P; } while (!S.empty()) { int f = S.top(); S.pop(); BACK.push( f ); } } int main(){ ios_base::sync_with_stdio(0); cin.tie(0); // 33 554 432 bitow pamieci // 4 194 304 bajtow // mao int n; cin >> n; vi rest; clear(); char c; int cnt = 0; int hsh_ptr = 0; while ( cin >> c) { arr[ cnt ] = c; cnt ++; if ( cnt == 6) { cnt = 0; hashed[ hsh_ptr ++ ] = hashing(); clear(); } //cout << c << " "; }//cout << endl; int diff = 0; FOR0(6)if( arr[ i ] != '0') diff ++; if( diff ) hashed[ hsh_ptr ++ ] = hashing(); //cout << "na ostatnim zostalo: " << diff << " miejsce: " << hsh_ptr << endl; // FOR0(hsh_ptr) cout << hashed [ i ] << " "; // cout << endl << endl; int last = hashed[ hsh_ptr - 1]; de_hash_back( last ); int p = 0; int k = hsh_ptr - 2; if( diff == 0) k ++; while ( p <= k ) { de_hash_front( hashed[ p ]); de_hash_back( hashed[ k ]); p ++; k --; while (!FRONT.empty() and !BACK.empty()) { int f = FRONT.front(); int b = BACK.front(); FRONT.pop(); BACK.pop(); // cout << f << " " << b << endl; if( f != b){ cout << "NIE\n"; return 0; } } } //cout << "Queues sizes: " << FRONT.size() << " " << BACK.size() << endl; while (!BACK.empty()) { int r = BACK.front(); BACK.pop(); rest.pb( r ); } p = 0; k = (int)rest.size() - 1; while (p < k) { if( rest[ p ] != rest[ k ]){ cout << "NIE\n"; return 0; } p ++; k --; } cout << "TAK\n"; return 0; } |