#include <iostream> #include <vector> using namespace std; unsigned int n, m, q; vector<vector<int>> sets; void sum(vector<int>& set, int x, int y){ for(int i = 0; i < sets[x].size(); i++){ set.push_back(sets[x][i]); } for(int i = 0; i < sets[y].size(); i++){ set.push_back(sets[y][i]); } } void mul(vector<int>& set, int x, int y){ for(int i = 0; i < sets[x].size(); i++){ for(int j = 0; j < sets[y].size(); j++){ if(sets[x][i] == sets[y][j]){ set.push_back(sets[x][i]); } } } } void neg(vector<int>& set, int x){ bool found = false; for(int i = 1; i <= n; i++){ found = false; for(int j = 0; j < sets[x].size(); j++){ if(sets[x][j] == i){ found = true; } } if(!found){ set.push_back(i); } } } bool contains(vector<int> set, int a){ for(int i = 0; i < set.size(); i++){ if(set[i] == a){ return true; } } return false; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m >> q; int start = 1, jump = 1; for(int i = 0; i < n; i++){ vector<int> set; for(int j = start; j <= n; j += jump){ set.push_back(j); } sets.push_back(set); start++; jump++; } int id, x, y; for(int i = 0; i < m; i++){ cin >> id; vector<int> set; if(id == 1){ cin >> x >> y; sum(set, x - 1, y - 1); } else if(id == 2){ cin >> x >> y; mul(set, x - 1, y - 1); } else{ cin >> x; neg(set, x - 1); } sets.push_back(set); } int index, val; for(int i = 0; i < q; i++){ cin >> index >> val; if(contains(sets[index - 1], val)){ cout << "TAK\n"; } else{ cout << "NIE\n"; } } }
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 | #include <iostream> #include <vector> using namespace std; unsigned int n, m, q; vector<vector<int>> sets; void sum(vector<int>& set, int x, int y){ for(int i = 0; i < sets[x].size(); i++){ set.push_back(sets[x][i]); } for(int i = 0; i < sets[y].size(); i++){ set.push_back(sets[y][i]); } } void mul(vector<int>& set, int x, int y){ for(int i = 0; i < sets[x].size(); i++){ for(int j = 0; j < sets[y].size(); j++){ if(sets[x][i] == sets[y][j]){ set.push_back(sets[x][i]); } } } } void neg(vector<int>& set, int x){ bool found = false; for(int i = 1; i <= n; i++){ found = false; for(int j = 0; j < sets[x].size(); j++){ if(sets[x][j] == i){ found = true; } } if(!found){ set.push_back(i); } } } bool contains(vector<int> set, int a){ for(int i = 0; i < set.size(); i++){ if(set[i] == a){ return true; } } return false; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> n >> m >> q; int start = 1, jump = 1; for(int i = 0; i < n; i++){ vector<int> set; for(int j = start; j <= n; j += jump){ set.push_back(j); } sets.push_back(set); start++; jump++; } int id, x, y; for(int i = 0; i < m; i++){ cin >> id; vector<int> set; if(id == 1){ cin >> x >> y; sum(set, x - 1, y - 1); } else if(id == 2){ cin >> x >> y; mul(set, x - 1, y - 1); } else{ cin >> x; neg(set, x - 1); } sets.push_back(set); } int index, val; for(int i = 0; i < q; i++){ cin >> index >> val; if(contains(sets[index - 1], val)){ cout << "TAK\n"; } else{ cout << "NIE\n"; } } } |