#include <iostream> #include <vector> #include <string> #include <set> #include <array> using namespace std; int main() { int n; cin >> n; string a, b; cin >> a >> b; // multiset<char> oddChars; // multiset<char> evenChars; array<multiset<char>, 2> moduloChars; for (int i = 0; i < n; ++i) { // if (i%2==0) // evenChars.insert(a[i]); // else // oddChars.insert(a[i]); moduloChars[i%2].insert(a[i]); } for (int i = 0; i < n; ++i) { auto ptr = moduloChars[i%2].find(b[i]); if (ptr != moduloChars[i%2].end()) moduloChars[i%2].erase(ptr); else { cout << "NIE\n"; return 0; } } cout << "TAK\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 | #include <iostream> #include <vector> #include <string> #include <set> #include <array> using namespace std; int main() { int n; cin >> n; string a, b; cin >> a >> b; // multiset<char> oddChars; // multiset<char> evenChars; array<multiset<char>, 2> moduloChars; for (int i = 0; i < n; ++i) { // if (i%2==0) // evenChars.insert(a[i]); // else // oddChars.insert(a[i]); moduloChars[i%2].insert(a[i]); } for (int i = 0; i < n; ++i) { auto ptr = moduloChars[i%2].find(b[i]); if (ptr != moduloChars[i%2].end()) moduloChars[i%2].erase(ptr); else { cout << "NIE\n"; return 0; } } cout << "TAK\n"; } |