#include <cstdio> #include <cstring> #include <cmath> #include <cassert> #include <iostream> #include <algorithm> #include <iterator> #include <string> #include <vector> #include <queue> #include <bitset> #include <utility> #include <stack> using namespace std; typedef long long LL; typedef pair<int,int> PII; typedef vector<int> VI; #define MP make_pair #define FOR(v,p,k) for(int v=(p);v<=(k);++v) #define FORD(v,p,k) for(int v=(p);v>=(k);--v) #define REP(i,n) for(int i=0;i<(n);++i) #define VAR(v,i) __typeof(i) v=(i) #define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i) #define PB push_back #define ST first #define ND second #define SIZE(x) (int)x.size() #define ALL(c) c.begin(),c.end() #define ODD(x) ((x)%2) #define EVEN(x) (!(ODD(x))) int main() { int t; scanf("%d\n", &t); while (t--) { int n; scanf("%d\n", &n); VI from(n + 1), to(n + 1); int input_sum = 0, output_sum = 0; FOR(i, 1, n) { char c; scanf("%c", &c); from[i] = c - '0'; input_sum += from[i]; } scanf("\n"); bool equal = true; FOR(i, 1, n) { char c; scanf("%c", &c); to[i] = c - '0'; output_sum += to[i]; if (from[i] != to[i]) { equal = false; } }; scanf("\n"); bool input_is_monocolor = ((input_sum % n) == 0); bool output_is_monocolor = ((output_sum % n) == 0); bool has_monocolor_edge = false; vector<VI> neighs(n + 1); REP(i, n - 1) { int a, b; scanf("%d %d", &a, &b); neighs[a].PB(b); neighs[b].PB(a); if (to[a] == to[b]) { has_monocolor_edge = true; } } int max_deg = 0; FOR(i, 1, n) { max_deg = max(max_deg, (int) neighs[i].size()); } bool is_list = (max_deg <= 2); bool res; if (from == to) { //printf("from==to\n"); res = true; } else if (input_is_monocolor) { //printf("input_is_monocolor\n"); res = false; } else if (output_is_monocolor) { //printf("output_is_monocolor\n"); res = true; } else if (!is_list) { res = has_monocolor_edge; //printf("!is_list\n"); } else { //printf("else\n"); int source; FOR(i, 1, n) { if (neighs[i].size() == 1) { source = i; } } //printf("else2 %d\n", source); VI input_list_colors(n), output_list_colors(n); int prev = -1; REP(i, n) { input_list_colors[i] = from[source]; output_list_colors[i] = to[source]; FOREACH(it, neighs[source]) { //printf("%d %d\n", source, *it); if (*it != prev) { prev = source; source = *it; break; } } } //printf("else3 %d\n", source); int input_alter = 0, output_alter = 0; prev = input_list_colors[0]; REP(i, n) { if (input_list_colors[i] != prev) { input_alter++; } prev = input_list_colors[i]; } prev = output_list_colors[0]; REP(i, n) { if (output_list_colors[i] != prev) { output_alter++; } prev = output_list_colors[i]; } res = (output_alter < input_alter) || ((output_alter == input_alter) && (input_list_colors[0] == output_list_colors[0])); } printf("%s\n", res ? "TAK" : "NIE"); } 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 | #include <cstdio> #include <cstring> #include <cmath> #include <cassert> #include <iostream> #include <algorithm> #include <iterator> #include <string> #include <vector> #include <queue> #include <bitset> #include <utility> #include <stack> using namespace std; typedef long long LL; typedef pair<int,int> PII; typedef vector<int> VI; #define MP make_pair #define FOR(v,p,k) for(int v=(p);v<=(k);++v) #define FORD(v,p,k) for(int v=(p);v>=(k);--v) #define REP(i,n) for(int i=0;i<(n);++i) #define VAR(v,i) __typeof(i) v=(i) #define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i) #define PB push_back #define ST first #define ND second #define SIZE(x) (int)x.size() #define ALL(c) c.begin(),c.end() #define ODD(x) ((x)%2) #define EVEN(x) (!(ODD(x))) int main() { int t; scanf("%d\n", &t); while (t--) { int n; scanf("%d\n", &n); VI from(n + 1), to(n + 1); int input_sum = 0, output_sum = 0; FOR(i, 1, n) { char c; scanf("%c", &c); from[i] = c - '0'; input_sum += from[i]; } scanf("\n"); bool equal = true; FOR(i, 1, n) { char c; scanf("%c", &c); to[i] = c - '0'; output_sum += to[i]; if (from[i] != to[i]) { equal = false; } }; scanf("\n"); bool input_is_monocolor = ((input_sum % n) == 0); bool output_is_monocolor = ((output_sum % n) == 0); bool has_monocolor_edge = false; vector<VI> neighs(n + 1); REP(i, n - 1) { int a, b; scanf("%d %d", &a, &b); neighs[a].PB(b); neighs[b].PB(a); if (to[a] == to[b]) { has_monocolor_edge = true; } } int max_deg = 0; FOR(i, 1, n) { max_deg = max(max_deg, (int) neighs[i].size()); } bool is_list = (max_deg <= 2); bool res; if (from == to) { //printf("from==to\n"); res = true; } else if (input_is_monocolor) { //printf("input_is_monocolor\n"); res = false; } else if (output_is_monocolor) { //printf("output_is_monocolor\n"); res = true; } else if (!is_list) { res = has_monocolor_edge; //printf("!is_list\n"); } else { //printf("else\n"); int source; FOR(i, 1, n) { if (neighs[i].size() == 1) { source = i; } } //printf("else2 %d\n", source); VI input_list_colors(n), output_list_colors(n); int prev = -1; REP(i, n) { input_list_colors[i] = from[source]; output_list_colors[i] = to[source]; FOREACH(it, neighs[source]) { //printf("%d %d\n", source, *it); if (*it != prev) { prev = source; source = *it; break; } } } //printf("else3 %d\n", source); int input_alter = 0, output_alter = 0; prev = input_list_colors[0]; REP(i, n) { if (input_list_colors[i] != prev) { input_alter++; } prev = input_list_colors[i]; } prev = output_list_colors[0]; REP(i, n) { if (output_list_colors[i] != prev) { output_alter++; } prev = output_list_colors[i]; } res = (output_alter < input_alter) || ((output_alter == input_alter) && (input_list_colors[0] == output_list_colors[0])); } printf("%s\n", res ? "TAK" : "NIE"); } return 0; } |