#include <bits/stdc++.h> using namespace std; #ifdef D #define DEBUG(x) \ do { \ x \ cout.flush(); \ } while (0) #else #define DEBUG(x) #endif const int NMAX = 1e5 + 7; int tt, n, a, b, zmiany1, zmiany2; string s1, s2; vector<int> t[NMAX]; bool only_one_color() { for (int i = 1; i < (int) s1.size(); ++i) { if (s1[i] != s1[i - 1]) return false; } return true; } bool is_path() { for (int i = 1; i <= n; ++i) { if (t[i].size() > 2) return false; } return true; } void dfs1(int v, int o, char c) { if (c != s1[v - 1]) { zmiany1++; } for (int u : t[v]) { if (u != o) { dfs1(u, v, s1[v - 1]); } } } void dfs2(int v, int o, char c) { if (c != s2[v - 1]) { zmiany2++; } for (int u : t[v]) { if (u != o) { dfs2(u, v, s2[v - 1]); } } } bool is_impossible_path_helper(int begin, int o, bool b) { zmiany1 = 0; dfs1(begin, o, '\0'); zmiany2 = 0; dfs2(begin, o, '\0'); if (zmiany2 > zmiany1) { return true; } if (zmiany2 == zmiany1 && s1[begin - 1] != s2[begin - 1] && b) { return true; } return false; } bool is_impossible_path() { int begin; for (int i = 1; i <= n; ++i) { if (t[i].size() == 1) { begin = i; break; } } return is_impossible_path_helper(begin, -1, true); } bool impossible; bool dfs3(int v, int o) { if (impossible) { return false; } bool b = true; for (int u : t[v]) { if (u != o) { b &= dfs3(u, v); } } // if (b && (t[v].size() > 2 && o != -1)) { if (b && t[v].size() > 2) { char c = s2[v - 1]; for (int u : t[v]) { if (u != o) { if (s2[u - 1] == c) { goto skip; } } } for (int u : t[v]) { if (u != o) { if (is_impossible_path_helper(u, v, false)) { impossible = true; break; } } } } skip: return b && t[v].size() <= 2; } bool is_impossible() { int begin; for (int i = 1; i <= n; ++i) { if (t[i].size() > 2) { begin = i; break; } } impossible = false; dfs3(begin, -1); return impossible; } bool ok() { for (int i = 1; i <= n; ++i) { if (t[i].size() >= 3) { for (int j = 1; j < t[i].size(); j++) { if (s2[t[i][j] - 1] != s2[t[i][j - 1] - 1]) { return true; } } } } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> tt; for (int ii = 0; ii < tt; ++ii) { cin >> n >> s1 >> s2; for (int i = 0; i < n - 1; ++i) { cin >> a >> b; t[a].push_back(b); t[b].push_back(a); } if (s1 == s2) { cout << "TAK\n"; } else if (only_one_color()) { cout << "NIE\n"; } else if (ok()) { cout << "TAK\n"; } else if (is_path()) { if (is_impossible_path()) { cout << "NIE\n"; } else { cout << "TAK\n"; } } else if (is_impossible()) { cout << "NIE\n"; } else { cout << "TAK\n"; } for (int i = 1; i <= n; ++i) { t[i].clear(); } } 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 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 | #include <bits/stdc++.h> using namespace std; #ifdef D #define DEBUG(x) \ do { \ x \ cout.flush(); \ } while (0) #else #define DEBUG(x) #endif const int NMAX = 1e5 + 7; int tt, n, a, b, zmiany1, zmiany2; string s1, s2; vector<int> t[NMAX]; bool only_one_color() { for (int i = 1; i < (int) s1.size(); ++i) { if (s1[i] != s1[i - 1]) return false; } return true; } bool is_path() { for (int i = 1; i <= n; ++i) { if (t[i].size() > 2) return false; } return true; } void dfs1(int v, int o, char c) { if (c != s1[v - 1]) { zmiany1++; } for (int u : t[v]) { if (u != o) { dfs1(u, v, s1[v - 1]); } } } void dfs2(int v, int o, char c) { if (c != s2[v - 1]) { zmiany2++; } for (int u : t[v]) { if (u != o) { dfs2(u, v, s2[v - 1]); } } } bool is_impossible_path_helper(int begin, int o, bool b) { zmiany1 = 0; dfs1(begin, o, '\0'); zmiany2 = 0; dfs2(begin, o, '\0'); if (zmiany2 > zmiany1) { return true; } if (zmiany2 == zmiany1 && s1[begin - 1] != s2[begin - 1] && b) { return true; } return false; } bool is_impossible_path() { int begin; for (int i = 1; i <= n; ++i) { if (t[i].size() == 1) { begin = i; break; } } return is_impossible_path_helper(begin, -1, true); } bool impossible; bool dfs3(int v, int o) { if (impossible) { return false; } bool b = true; for (int u : t[v]) { if (u != o) { b &= dfs3(u, v); } } // if (b && (t[v].size() > 2 && o != -1)) { if (b && t[v].size() > 2) { char c = s2[v - 1]; for (int u : t[v]) { if (u != o) { if (s2[u - 1] == c) { goto skip; } } } for (int u : t[v]) { if (u != o) { if (is_impossible_path_helper(u, v, false)) { impossible = true; break; } } } } skip: return b && t[v].size() <= 2; } bool is_impossible() { int begin; for (int i = 1; i <= n; ++i) { if (t[i].size() > 2) { begin = i; break; } } impossible = false; dfs3(begin, -1); return impossible; } bool ok() { for (int i = 1; i <= n; ++i) { if (t[i].size() >= 3) { for (int j = 1; j < t[i].size(); j++) { if (s2[t[i][j] - 1] != s2[t[i][j - 1] - 1]) { return true; } } } } return false; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> tt; for (int ii = 0; ii < tt; ++ii) { cin >> n >> s1 >> s2; for (int i = 0; i < n - 1; ++i) { cin >> a >> b; t[a].push_back(b); t[b].push_back(a); } if (s1 == s2) { cout << "TAK\n"; } else if (only_one_color()) { cout << "NIE\n"; } else if (ok()) { cout << "TAK\n"; } else if (is_path()) { if (is_impossible_path()) { cout << "NIE\n"; } else { cout << "TAK\n"; } } else if (is_impossible()) { cout << "NIE\n"; } else { cout << "TAK\n"; } for (int i = 1; i <= n; ++i) { t[i].clear(); } } return 0; } |