#include <bits/stdc++.h> using namespace std; #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin()) #define sz(v) ((int)(v).size()) #define vec1d(x) vector<x> #define vec2d(x) vector<vec1d(x)> #define vec3d(x) vector<vec2d(x)> #define vec4d(x) vector<vec3d(x)> #define ivec1d(x, n, v) vec1d(x)(n, v) #define ivec2d(x, n, m, v) vec2d(x)(n, ivec1d(x, m, v)) #define ivec3d(x, n, m, k, v) vec3d(x)(n, ivec2d(x, m, k, v)) #define ivec4d(x, n, m, k, l, v) vec4d(x)(n, ivec3d(x, m, k, l, v)) #ifdef LOCAL #include "pretty_print.h" #define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__) #else #define dbg(...) 42 #endif #define nl "\n" typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; template <typename T> T sqr(T x) { return x * x; } template <typename T> T abs(T x) { return x < 0? -x : x; } template <typename T> T gcd(T a, T b) { return b? gcd(b, a % b) : a; } template <typename T> bool chmin(T &x, const T& y) { if (x > y) { x = y; return true; } return false; } template <typename T> bool chmax(T &x, const T& y) { if (x < y) { x = y; return true; } return false; } auto random_address = [] { char *p = new char; delete p; return (uint64_t) p; }; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1)); mt19937_64 rngll(chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1)); const string YES = "TAK"; const string NO = "NIE"; int main(int /* argc */, const char** /* argv */) { ios_base::sync_with_stdio(false); cin.tie(NULL); #ifdef LOCAL assert(freopen("i.txt", "r", stdin)); assert(freopen("o.txt", "w", stdout)); #endif int t; cin >> t; while (t--) { int n; cin >> n; string a, b; cin >> a >> b; vector<vector<int>> e(n); bool has_same = false; for (int i = 1; i < n; ++i) { int u, v; cin >> u >> v; --u; --v; e[u].push_back(v); e[v].push_back(u); has_same |= b[u] == b[v]; } if (a == b) { cout << YES << nl; continue; } if (!has_same) { cout << NO << nl; continue; } bool a0 = a.find("0") != string::npos; bool a1 = a.find("1") != string::npos; bool b0 = b.find("0") != string::npos; bool b1 = b.find("1") != string::npos; if ((b0 && !a0) || (b1 && !a1)) { cout << NO << nl; continue; } vector<int> v; for (int i = 0; i < n; ++i) { if (sz(e[i]) == 1) { v.push_back(i); } } if (sz(v) > 2) { cout << YES << nl; continue; } int x = v[0]; int p = -1; vector<int> o; for (int i = 0; i < n; ++i) { o.push_back(x); for (auto& y : e[x]) { if (y != p) { p = x; x = y; break; } } } auto get_s = [&](string s) { string ret; for (auto& x : o) { if (sz(ret) == 0 || ret.back() != s[x]) { ret += s[x]; } } return ret; }; a = get_s(a); b = get_s(b); if (a[0] != b[0]) { a = a.substr(1); } if (sz(a) >= sz(b)) { cout << YES << nl; continue; } cout << NO << nl; } #ifdef LOCAL cerr << "Time execute: " << clock() / (double)CLOCKS_PER_SEC << " sec" << endl; #endif 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 | #include <bits/stdc++.h> using namespace std; #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define reunique(v) v.resize(std::unique(v.begin(), v.end()) - v.begin()) #define sz(v) ((int)(v).size()) #define vec1d(x) vector<x> #define vec2d(x) vector<vec1d(x)> #define vec3d(x) vector<vec2d(x)> #define vec4d(x) vector<vec3d(x)> #define ivec1d(x, n, v) vec1d(x)(n, v) #define ivec2d(x, n, m, v) vec2d(x)(n, ivec1d(x, m, v)) #define ivec3d(x, n, m, k, v) vec3d(x)(n, ivec2d(x, m, k, v)) #define ivec4d(x, n, m, k, l, v) vec4d(x)(n, ivec3d(x, m, k, l, v)) #ifdef LOCAL #include "pretty_print.h" #define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: ", debug_out(__VA_ARGS__) #else #define dbg(...) 42 #endif #define nl "\n" typedef long double ld; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; template <typename T> T sqr(T x) { return x * x; } template <typename T> T abs(T x) { return x < 0? -x : x; } template <typename T> T gcd(T a, T b) { return b? gcd(b, a % b) : a; } template <typename T> bool chmin(T &x, const T& y) { if (x > y) { x = y; return true; } return false; } template <typename T> bool chmax(T &x, const T& y) { if (x < y) { x = y; return true; } return false; } auto random_address = [] { char *p = new char; delete p; return (uint64_t) p; }; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1)); mt19937_64 rngll(chrono::steady_clock::now().time_since_epoch().count() * (random_address() | 1)); const string YES = "TAK"; const string NO = "NIE"; int main(int /* argc */, const char** /* argv */) { ios_base::sync_with_stdio(false); cin.tie(NULL); #ifdef LOCAL assert(freopen("i.txt", "r", stdin)); assert(freopen("o.txt", "w", stdout)); #endif int t; cin >> t; while (t--) { int n; cin >> n; string a, b; cin >> a >> b; vector<vector<int>> e(n); bool has_same = false; for (int i = 1; i < n; ++i) { int u, v; cin >> u >> v; --u; --v; e[u].push_back(v); e[v].push_back(u); has_same |= b[u] == b[v]; } if (a == b) { cout << YES << nl; continue; } if (!has_same) { cout << NO << nl; continue; } bool a0 = a.find("0") != string::npos; bool a1 = a.find("1") != string::npos; bool b0 = b.find("0") != string::npos; bool b1 = b.find("1") != string::npos; if ((b0 && !a0) || (b1 && !a1)) { cout << NO << nl; continue; } vector<int> v; for (int i = 0; i < n; ++i) { if (sz(e[i]) == 1) { v.push_back(i); } } if (sz(v) > 2) { cout << YES << nl; continue; } int x = v[0]; int p = -1; vector<int> o; for (int i = 0; i < n; ++i) { o.push_back(x); for (auto& y : e[x]) { if (y != p) { p = x; x = y; break; } } } auto get_s = [&](string s) { string ret; for (auto& x : o) { if (sz(ret) == 0 || ret.back() != s[x]) { ret += s[x]; } } return ret; }; a = get_s(a); b = get_s(b); if (a[0] != b[0]) { a = a.substr(1); } if (sz(a) >= sz(b)) { cout << YES << nl; continue; } cout << NO << nl; } #ifdef LOCAL cerr << "Time execute: " << clock() / (double)CLOCKS_PER_SEC << " sec" << endl; #endif return 0; } |