/* * Opis: Główny nagłówek */ #include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r)for(int i=(l);i<=(r);++i) #define REP(i,n)FOR(i,0,(n)-1) #define ssize(x)int(x.size()) #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif constexpr int MAXN = 2e5; template<int N=4> void solve(int n, int m, int q) { if (n + 1 > N) { return solve<min(2*N, MAXN)>(n, m, q); } vector<bitset<N>> arr(n + m); FOR(i, 1, n) { for (int j = i; j <= n; j += i) { arr[i-1].set(j); } } REP(i, m) { int type; cin >> type; if (type == 1) { // Sum int a, b; cin >> a >> b; a--, b--; arr[n+i] = (arr[a] | arr[b]); } else if (type == 2) { // Ilo int a, b; cin >> a >> b; a--, b--; arr[n+i] = (arr[a] & arr[b]); } else if (type == 3) { int a; cin >> a; a--; arr[n+i] = ~arr[a]; } } REP(i, q) { int x, v; cin >> x >> v; x--; if (arr[x].test(v)) { cout << "TAK\n"; } else { cout << "NIE\n"; } } // REP(i, n+m) { // debug(arr[i]); // } } int main() { cin.tie(0)->sync_with_stdio(0); int n, m, q; cin >> n >> m >> q; solve(n, m, q); }
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 | /* * Opis: Główny nagłówek */ #include<bits/stdc++.h> using namespace std; using LL=long long; #define FOR(i,l,r)for(int i=(l);i<=(r);++i) #define REP(i,n)FOR(i,0,(n)-1) #define ssize(x)int(x.size()) #ifdef DEBUG auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";} auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";} #define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X) #else #define debug(...){} #endif constexpr int MAXN = 2e5; template<int N=4> void solve(int n, int m, int q) { if (n + 1 > N) { return solve<min(2*N, MAXN)>(n, m, q); } vector<bitset<N>> arr(n + m); FOR(i, 1, n) { for (int j = i; j <= n; j += i) { arr[i-1].set(j); } } REP(i, m) { int type; cin >> type; if (type == 1) { // Sum int a, b; cin >> a >> b; a--, b--; arr[n+i] = (arr[a] | arr[b]); } else if (type == 2) { // Ilo int a, b; cin >> a >> b; a--, b--; arr[n+i] = (arr[a] & arr[b]); } else if (type == 3) { int a; cin >> a; a--; arr[n+i] = ~arr[a]; } } REP(i, q) { int x, v; cin >> x >> v; x--; if (arr[x].test(v)) { cout << "TAK\n"; } else { cout << "NIE\n"; } } // REP(i, n+m) { // debug(arr[i]); // } } int main() { cin.tie(0)->sync_with_stdio(0); int n, m, q; cin >> n >> m >> q; solve(n, m, q); } |