#include <algorithm> #include <bitset> #include <cmath> #include <cstdlib> #include <ctime> #include <deque> #include <iostream> #include <list> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <vector> using namespace std; #define JOIN_(X, Y) X##Y #define JOIN(X, Y) JOIN_(X, Y) #define TMP JOIN(tmp, __LINE__) #define PB push_back #define SZ(x) int((x).size()) #define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i) #define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i) #define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i) #ifdef DEBUG #define DEB(x) (cerr << x) #else #define DEB(x) #endif typedef long long ll; typedef vector<int> vi; typedef pair<int, int> pii; typedef unsigned int uint; const int INF = 1e9 + 9; void inline one() { int n, m, q; cin >> n >> m >> q; vector<bitset<50000>> a(n + m + 1); FOR(i, 1, n) { for (int j = i; j <= n; j += i) { a[i].set(j - 1); } // DEB("i=" << i << " " << bitset<20>(a[i].to_ullong()) << "\n"); } FOR(i, n + 1, n + m) { int typ; cin >> typ; if (typ == 1) { // set union int x, y; cin >> x >> y; a[i] = a[x] | a[y]; } else if (typ == 2) { // set intersection int x, y; cin >> x >> y; a[i] = a[x] & a[y]; } else if (typ == 3) { // set complement int x; cin >> x; a[i] = ~a[x]; } else { throw "unsupported type"; } // DEB("\ti=" << i << " " << (a[i].to_string().substr(SZ(a[i]) - 20)) << "\n"); } REP(i, q) { int x, v; cin >> x >> v; cout << (a[x].test(v - 1) ? "TAK\n" : "NIE\n"); } } int main() { ios::sync_with_stdio(false); cin.tie(0); // int z; cin >> z; while(z--) one(); }
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 | #include <algorithm> #include <bitset> #include <cmath> #include <cstdlib> #include <ctime> #include <deque> #include <iostream> #include <list> #include <map> #include <queue> #include <set> #include <stack> #include <string> #include <vector> using namespace std; #define JOIN_(X, Y) X##Y #define JOIN(X, Y) JOIN_(X, Y) #define TMP JOIN(tmp, __LINE__) #define PB push_back #define SZ(x) int((x).size()) #define REP(i, n) for (int i = 0, TMP = (n); i < TMP; ++i) #define FOR(i, a, b) for (int i = (a), TMP = (b); i <= TMP; ++i) #define FORD(i, a, b) for (int i = (a), TMP = (b); i >= TMP; --i) #ifdef DEBUG #define DEB(x) (cerr << x) #else #define DEB(x) #endif typedef long long ll; typedef vector<int> vi; typedef pair<int, int> pii; typedef unsigned int uint; const int INF = 1e9 + 9; void inline one() { int n, m, q; cin >> n >> m >> q; vector<bitset<50000>> a(n + m + 1); FOR(i, 1, n) { for (int j = i; j <= n; j += i) { a[i].set(j - 1); } // DEB("i=" << i << " " << bitset<20>(a[i].to_ullong()) << "\n"); } FOR(i, n + 1, n + m) { int typ; cin >> typ; if (typ == 1) { // set union int x, y; cin >> x >> y; a[i] = a[x] | a[y]; } else if (typ == 2) { // set intersection int x, y; cin >> x >> y; a[i] = a[x] & a[y]; } else if (typ == 3) { // set complement int x; cin >> x; a[i] = ~a[x]; } else { throw "unsupported type"; } // DEB("\ti=" << i << " " << (a[i].to_string().substr(SZ(a[i]) - 20)) << "\n"); } REP(i, q) { int x, v; cin >> x >> v; cout << (a[x].test(v - 1) ? "TAK\n" : "NIE\n"); } } int main() { ios::sync_with_stdio(false); cin.tie(0); // int z; cin >> z; while(z--) one(); } |