#include <bits/stdc++.h> using namespace std; #define all(x) begin(x),end(x) #define pb push_back #define st first #define nd second typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; const int INF = 2e9; const ll LLINF = 2e18; void solve() { int n,m,q; cin>>n>>m>>q; vector<set<int>> sets(n+m+1); for(int i=1; i<=n; ++i) for(int j=i; j<=n; j+=i) sets[i].insert(j); for(int i=n+1; i<=n+m; ++i) { int t; cin>>t; int x,y; switch(t) { case 1: cin>>x>>y; set_union(sets[x].begin(),sets[x].end(),sets[y].begin(),sets[y].end(),inserter(sets[i],sets[i].begin())); break; case 2: cin>>x>>y; set_intersection(sets[x].begin(),sets[x].end(),sets[y].begin(),sets[y].end(),inserter(sets[i],sets[i].begin())); break; case 3: cin>>x; set_difference(sets[1].begin(),sets[1].end(),sets[x].begin(),sets[x].end(),inserter(sets[i],sets[i].begin())); break; } } while(q--) { int x,v; cin>>x>>v; cout<< ((sets[x].contains(v)) ? "TAK" : "NIE") <<endl; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int z=1; //cin>>z; while(z--) solve(); 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 | #include <bits/stdc++.h> using namespace std; #define all(x) begin(x),end(x) #define pb push_back #define st first #define nd second typedef long long ll; typedef vector<int> vi; typedef vector<ll> vll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; const int INF = 2e9; const ll LLINF = 2e18; void solve() { int n,m,q; cin>>n>>m>>q; vector<set<int>> sets(n+m+1); for(int i=1; i<=n; ++i) for(int j=i; j<=n; j+=i) sets[i].insert(j); for(int i=n+1; i<=n+m; ++i) { int t; cin>>t; int x,y; switch(t) { case 1: cin>>x>>y; set_union(sets[x].begin(),sets[x].end(),sets[y].begin(),sets[y].end(),inserter(sets[i],sets[i].begin())); break; case 2: cin>>x>>y; set_intersection(sets[x].begin(),sets[x].end(),sets[y].begin(),sets[y].end(),inserter(sets[i],sets[i].begin())); break; case 3: cin>>x; set_difference(sets[1].begin(),sets[1].end(),sets[x].begin(),sets[x].end(),inserter(sets[i],sets[i].begin())); break; } } while(q--) { int x,v; cin>>x>>v; cout<< ((sets[x].contains(v)) ? "TAK" : "NIE") <<endl; } } int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); int z=1; //cin>>z; while(z--) solve(); return 0; } |