#include <bits/stdc++.h> using namespace std; int main() { //ios_base::sync_with_stdio(false); //cin.tie(nullptr); char buffer[100]; int n, m, q; int oper_type, set1, set2; fgets(buffer, sizeof(buffer), stdin); sscanf(buffer, "%d %d %d", &n, &m, &q); vector<set<int>> sets(n + m + 1); set<int> base_set; for (int i = 1; i <= n; ++i) { base_set.insert(i); for (int j = i; j <= n; j += i) { sets[i].insert(j); } } int target; for (int i = 1; i <= m; i++) { fgets(buffer, sizeof(buffer), stdin); int count = sscanf(buffer, "%d %d %d", &oper_type, &set1, &set2); target = n + i; if (oper_type == 1) { set_union(sets[set1].begin(), sets[set1].end(), sets[set2].begin(), sets[set2].end(), inserter(sets[target], sets[target].begin())); } else if (oper_type == 2) { set_intersection(sets[set1].begin(), sets[set1].end(), sets[set2].begin(), sets[set2].end(), inserter(sets[target], sets[target].begin())); } else if (oper_type == 3) { set_difference(base_set.begin(), base_set.end(), sets[set1].begin(), sets[set1].end(), inserter(sets[target], sets[target].begin())); } } int x, v; for (int i = 1; i <= q; i++) { fgets(buffer, sizeof(buffer), stdin); sscanf(buffer, "%d %d", &x, &v); if (sets[x].find(v) != sets[x].end()) { printf("TAK\n"); } else { printf("NIE\n"); } } 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 | #include <bits/stdc++.h> using namespace std; int main() { //ios_base::sync_with_stdio(false); //cin.tie(nullptr); char buffer[100]; int n, m, q; int oper_type, set1, set2; fgets(buffer, sizeof(buffer), stdin); sscanf(buffer, "%d %d %d", &n, &m, &q); vector<set<int>> sets(n + m + 1); set<int> base_set; for (int i = 1; i <= n; ++i) { base_set.insert(i); for (int j = i; j <= n; j += i) { sets[i].insert(j); } } int target; for (int i = 1; i <= m; i++) { fgets(buffer, sizeof(buffer), stdin); int count = sscanf(buffer, "%d %d %d", &oper_type, &set1, &set2); target = n + i; if (oper_type == 1) { set_union(sets[set1].begin(), sets[set1].end(), sets[set2].begin(), sets[set2].end(), inserter(sets[target], sets[target].begin())); } else if (oper_type == 2) { set_intersection(sets[set1].begin(), sets[set1].end(), sets[set2].begin(), sets[set2].end(), inserter(sets[target], sets[target].begin())); } else if (oper_type == 3) { set_difference(base_set.begin(), base_set.end(), sets[set1].begin(), sets[set1].end(), inserter(sets[target], sets[target].begin())); } } int x, v; for (int i = 1; i <= q; i++) { fgets(buffer, sizeof(buffer), stdin); sscanf(buffer, "%d %d", &x, &v); if (sets[x].find(v) != sets[x].end()) { printf("TAK\n"); } else { printf("NIE\n"); } } return 0; } |