#include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define pb push_back #define debug(x) cout << #x << " " << x << endl #define all(x) x.begin(),x.end() #define ll long long #define vi vector<int> #define vvi vector<vi> #define vvvi vector<vvi> #define vll vector<ll> #define vvll vector<vll> #define ld long double #define ull unsigned long long #define vull vector<ull> #define fi first #define se second #define PII pair<int,int> #define vPII vector<PII> #define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());} #define int128 __int128 vi adj[100005]; int n; string s,k; int cols[100005], colk[100005]; int deg[100005]; vi poms, pomk; int test = -1; string odp[10000]; void f(int cur,int par){ poms.pb(cols[cur]); pomk.pb(colk[cur]); for(int nxt: adj[cur]){ if(nxt != par){ f(nxt,cur); } } } int solve(int cur){ poms.clear(); pomk.clear(); f(cur,-1); // vi des = poms; // vi dek = pomk; int w = 0; int i = 0; while(w < n and poms[w] != pomk[0]) w++; rep(j,w){ // des[j] = pomk[0]; poms[j] = pomk[0]; } if(w == n){ return 0; } for(i = 1; i < n; i++){ if(w > i){ if(pomk[i-1] != pomk[i]){// and poms[i-1] != 2){ while(w < n and poms[w] != pomk[i]) w++; poms[i] = pomk[i]; // des[i] = dek[i]; if(w == n){ return 0; } }else{ poms[i] = pomk[i]; // des[i] = dek[i]; } } else{ if(poms[i] != pomk[i]){ w = i; if(pomk[i] == pomk[i-1]){ poms[i] = 2; continue; }else if(poms[i-1] == 2 or poms[i-1] == pomk[i]){ poms[i] = 2; continue; } while(w < n and poms[w] != pomk[i]) w++; if(w == n){ return 0; } poms[i] = pomk[i]; // des[i] = dek[i]; }else { if(poms[i-1] != poms[i] and pomk[i-1] == pomk[i]){ poms[i] = 2; } } } } return 1; } int dfs(int cur, int par,int kol){ if(colk[cur] != kol) return 1; kol ^= 1; int ans = 0; for(int nxt: adj[cur]){ if(nxt != par){ ans |= dfs(nxt, cur, kol); } } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); // cout << setprecision(16) << fixed; // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); rep(xx,1) { // string in = "C:\\Users\\artur\\Downloads\\male_testy\\in\\dcc"; // in += to_string(xx+1); // in += ".in"; // string out = "C:\\Users\\artur\\Downloads\\male_testy\\out\\dcc"; // out += to_string(xx+1); // out += ".out"; // freopen(in.c_str(), "r", stdin); int tt = 1; cin >> tt; // tt = 42; test = -1; // string my_odp[tt]; while (tt--) { test++; cin >> n >> s >> k; rep(i, n + 1) { adj[i].clear(); deg[i] = 0; } int zers = 0, jes = 0, zerk = 0, jek = 0; for (int i = 1; i <= n; i++) { if (s[i - 1] == '1') { jes = 1; cols[i] = 1; } else { zers = 1; cols[i] = 0; } if (k[i - 1] == '1') { colk[i] = 1; jek = 1; } else { zerk = 1; colk[i] = 0; } } int maks = 0; // vPII kr; rep(i, n - 1) { int u, v; cin >> u >> v; // kr.pb({u,v}); deg[v]++; deg[u]++; maks = max({maks, deg[v], deg[u]}); adj[u].pb(v); adj[v].pb(u); } int ans; if (s == k) { ans = 1; } else if (zerk > zers or jek > jes) { ans = 0; } else if (maks <= 2) { int start = -1; int start2 = -1; rep(i, n) { if (deg[i + 1] == 1) { if (start == -1) { start = i + 1; } else { start2 = i + 1; } } } if(solve(start2) or solve(start)) ans = 1; else ans = 0; } else { if(dfs(1,-1,colk[1])) ans = 1; else ans = 0; } // if((ans and odp[test] == "NIE") or (!ans and odp[test] == "TAK")) { // cout << in << "\n"; // cout << n << "\n" << s << " " << k << "\n"; // for (PII p : kr) { // cout << p.fi << " " << p.se << "\n"; // } // return 0; // } // my_odp[test] = (ans ? "TAK" : "NIE"); cout << (ans ? "TAK\n" : "NIE\n"); } // freopen(out.c_str(), "r", stdin); // rep(i,test){ // string o; cin >> o; // if(my_odp[i] != o){ // cout << in << " " << i+1 << " " << o << "\n"; // } // } } } /* 1 6 100000 010011 2 1 3 2 4 2 5 1 6 5 */
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 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 | #include <bits/stdc++.h> using namespace std; #define rep(i, n) for(int i = 0; i < n; i++) #define pb push_back #define debug(x) cout << #x << " " << x << endl #define all(x) x.begin(),x.end() #define ll long long #define vi vector<int> #define vvi vector<vi> #define vvvi vector<vvi> #define vll vector<ll> #define vvll vector<vll> #define ld long double #define ull unsigned long long #define vull vector<ull> #define fi first #define se second #define PII pair<int,int> #define vPII vector<PII> #define getunique(v) {sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end());} #define int128 __int128 vi adj[100005]; int n; string s,k; int cols[100005], colk[100005]; int deg[100005]; vi poms, pomk; int test = -1; string odp[10000]; void f(int cur,int par){ poms.pb(cols[cur]); pomk.pb(colk[cur]); for(int nxt: adj[cur]){ if(nxt != par){ f(nxt,cur); } } } int solve(int cur){ poms.clear(); pomk.clear(); f(cur,-1); // vi des = poms; // vi dek = pomk; int w = 0; int i = 0; while(w < n and poms[w] != pomk[0]) w++; rep(j,w){ // des[j] = pomk[0]; poms[j] = pomk[0]; } if(w == n){ return 0; } for(i = 1; i < n; i++){ if(w > i){ if(pomk[i-1] != pomk[i]){// and poms[i-1] != 2){ while(w < n and poms[w] != pomk[i]) w++; poms[i] = pomk[i]; // des[i] = dek[i]; if(w == n){ return 0; } }else{ poms[i] = pomk[i]; // des[i] = dek[i]; } } else{ if(poms[i] != pomk[i]){ w = i; if(pomk[i] == pomk[i-1]){ poms[i] = 2; continue; }else if(poms[i-1] == 2 or poms[i-1] == pomk[i]){ poms[i] = 2; continue; } while(w < n and poms[w] != pomk[i]) w++; if(w == n){ return 0; } poms[i] = pomk[i]; // des[i] = dek[i]; }else { if(poms[i-1] != poms[i] and pomk[i-1] == pomk[i]){ poms[i] = 2; } } } } return 1; } int dfs(int cur, int par,int kol){ if(colk[cur] != kol) return 1; kol ^= 1; int ans = 0; for(int nxt: adj[cur]){ if(nxt != par){ ans |= dfs(nxt, cur, kol); } } return ans; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); // cout << setprecision(16) << fixed; // freopen("input.txt", "r", stdin); // freopen("output.txt", "w", stdout); rep(xx,1) { // string in = "C:\\Users\\artur\\Downloads\\male_testy\\in\\dcc"; // in += to_string(xx+1); // in += ".in"; // string out = "C:\\Users\\artur\\Downloads\\male_testy\\out\\dcc"; // out += to_string(xx+1); // out += ".out"; // freopen(in.c_str(), "r", stdin); int tt = 1; cin >> tt; // tt = 42; test = -1; // string my_odp[tt]; while (tt--) { test++; cin >> n >> s >> k; rep(i, n + 1) { adj[i].clear(); deg[i] = 0; } int zers = 0, jes = 0, zerk = 0, jek = 0; for (int i = 1; i <= n; i++) { if (s[i - 1] == '1') { jes = 1; cols[i] = 1; } else { zers = 1; cols[i] = 0; } if (k[i - 1] == '1') { colk[i] = 1; jek = 1; } else { zerk = 1; colk[i] = 0; } } int maks = 0; // vPII kr; rep(i, n - 1) { int u, v; cin >> u >> v; // kr.pb({u,v}); deg[v]++; deg[u]++; maks = max({maks, deg[v], deg[u]}); adj[u].pb(v); adj[v].pb(u); } int ans; if (s == k) { ans = 1; } else if (zerk > zers or jek > jes) { ans = 0; } else if (maks <= 2) { int start = -1; int start2 = -1; rep(i, n) { if (deg[i + 1] == 1) { if (start == -1) { start = i + 1; } else { start2 = i + 1; } } } if(solve(start2) or solve(start)) ans = 1; else ans = 0; } else { if(dfs(1,-1,colk[1])) ans = 1; else ans = 0; } // if((ans and odp[test] == "NIE") or (!ans and odp[test] == "TAK")) { // cout << in << "\n"; // cout << n << "\n" << s << " " << k << "\n"; // for (PII p : kr) { // cout << p.fi << " " << p.se << "\n"; // } // return 0; // } // my_odp[test] = (ans ? "TAK" : "NIE"); cout << (ans ? "TAK\n" : "NIE\n"); } // freopen(out.c_str(), "r", stdin); // rep(i,test){ // string o; cin >> o; // if(my_odp[i] != o){ // cout << in << " " << i+1 << " " << o << "\n"; // } // } } } /* 1 6 100000 010011 2 1 3 2 4 2 5 1 6 5 */ |