#include<bits/stdc++.h> #define ll long long #define pii pair<int, int> #define st first #define nd second #define turbo ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define pb push_back #define vi vector<int> #define vvi vector<vi> #define qi queue<int> #define ld long double using namespace std; /*---------------------------------------------------------///CODE///---------------------------------------------------------*/ vvi graph; vector<char> c1, c2; int n; int sum1, sum2; bool dfs(int v, int p, char c) { bool ok = false; for(auto i : graph[v]) if(i != p) if(c2[i - 1] == c) return true; for(auto i : graph[v]) if(i != p) { char cp = (c == '0' ? '1' : '0'); return dfs(i, v, cp); } return false; } pii liczprzeskoki(int v, int p) { pii x = {0, 0}; if(c1[v - 1] != c1[p - 1]) x.st ++; if(c2[v - 1] != c2[p - 1]) x.nd ++; for(auto i : graph[v]) if(i != p) { auto tmp = liczprzeskoki(i, v); return {x.st + tmp.st, x.nd + tmp.nd}; } return x; } int main() { turbo int t; cin >> t; while(t--) { cin >> n; graph = vvi(n + 10); c1 = c2 = vector<char>(n); for(int i = 0; i < n; i++) { cin >> c1[i]; if(c1[i] == '0') sum1 ++; else sum2 ++; } for(int i = 0; i < n; i++) cin >> c2[i]; for(int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; graph[a].pb(b); graph[b].pb(a); } bool sciezka = true, ok = false; if(c1 == c2) { cout << "TAK\n"; sum1 = 0; sum2 = 0; continue; } if(!sum1 || !sum2) { cout << "NIE\n"; sum1 = 0; sum2 = 0; continue; } else { bool ok2 = false; for(int i = 1; i <= n; i++) if(graph[i].size() > 2) { bool b1 = false, b2 = false; for(auto j : graph[i]) if(c2[j - 1] == '0') b1 = true; else b2 = true; if((b1 && b2) || (c2[i - 1] == '0' && b1) || (c2[i - 1] == '1' && b2)) ok2 = true; if(ok2) break; } if(ok2 && sum1 && sum2) { cout << "TAK\n"; sum1 = 0; sum2 = 0; continue; } } for(int i = 1; i <= n; i++) if(graph[i].size() > 2) { sciezka = false; for(auto j : graph[i]) if(c2[i - 1] == '0') ok |= dfs(j, i, '1'); else ok |= dfs(j, i, '0'); if(ok) break; } if(!sciezka && ok && sum1 && sum2) cout << "TAK\n"; else if(!sciezka) cout << "NIE\n"; else { int start; for(int i = 1; i <= n; i++) if(graph[i].size() == 1) { start = i; break; } auto przeskoki = liczprzeskoki(start, start); if(przeskoki.st > przeskoki.nd || ((przeskoki.st == przeskoki.nd) && (c1[start - 1] == c2[start - 1]))) cout << "TAK\n"; else cout << "NIE\n"; } sum1 = 0; sum2 = 0; } 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 | #include<bits/stdc++.h> #define ll long long #define pii pair<int, int> #define st first #define nd second #define turbo ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); #define pb push_back #define vi vector<int> #define vvi vector<vi> #define qi queue<int> #define ld long double using namespace std; /*---------------------------------------------------------///CODE///---------------------------------------------------------*/ vvi graph; vector<char> c1, c2; int n; int sum1, sum2; bool dfs(int v, int p, char c) { bool ok = false; for(auto i : graph[v]) if(i != p) if(c2[i - 1] == c) return true; for(auto i : graph[v]) if(i != p) { char cp = (c == '0' ? '1' : '0'); return dfs(i, v, cp); } return false; } pii liczprzeskoki(int v, int p) { pii x = {0, 0}; if(c1[v - 1] != c1[p - 1]) x.st ++; if(c2[v - 1] != c2[p - 1]) x.nd ++; for(auto i : graph[v]) if(i != p) { auto tmp = liczprzeskoki(i, v); return {x.st + tmp.st, x.nd + tmp.nd}; } return x; } int main() { turbo int t; cin >> t; while(t--) { cin >> n; graph = vvi(n + 10); c1 = c2 = vector<char>(n); for(int i = 0; i < n; i++) { cin >> c1[i]; if(c1[i] == '0') sum1 ++; else sum2 ++; } for(int i = 0; i < n; i++) cin >> c2[i]; for(int i = 0; i < n - 1; i++) { int a, b; cin >> a >> b; graph[a].pb(b); graph[b].pb(a); } bool sciezka = true, ok = false; if(c1 == c2) { cout << "TAK\n"; sum1 = 0; sum2 = 0; continue; } if(!sum1 || !sum2) { cout << "NIE\n"; sum1 = 0; sum2 = 0; continue; } else { bool ok2 = false; for(int i = 1; i <= n; i++) if(graph[i].size() > 2) { bool b1 = false, b2 = false; for(auto j : graph[i]) if(c2[j - 1] == '0') b1 = true; else b2 = true; if((b1 && b2) || (c2[i - 1] == '0' && b1) || (c2[i - 1] == '1' && b2)) ok2 = true; if(ok2) break; } if(ok2 && sum1 && sum2) { cout << "TAK\n"; sum1 = 0; sum2 = 0; continue; } } for(int i = 1; i <= n; i++) if(graph[i].size() > 2) { sciezka = false; for(auto j : graph[i]) if(c2[i - 1] == '0') ok |= dfs(j, i, '1'); else ok |= dfs(j, i, '0'); if(ok) break; } if(!sciezka && ok && sum1 && sum2) cout << "TAK\n"; else if(!sciezka) cout << "NIE\n"; else { int start; for(int i = 1; i <= n; i++) if(graph[i].size() == 1) { start = i; break; } auto przeskoki = liczprzeskoki(start, start); if(przeskoki.st > przeskoki.nd || ((przeskoki.st == przeskoki.nd) && (c1[start - 1] == c2[start - 1]))) cout << "TAK\n"; else cout << "NIE\n"; } sum1 = 0; sum2 = 0; } return 0; } |