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
#include <iostream>
#include <vector>
#include <bitset>

using namespace std;

const int MAX_N = 50005;
const int MAX_SIZE = 400005;

vector<bitset<MAX_N>> sets;

int n, m, q;
int o, x, y, v;

void initNSets()
{
	for (int i = 1; i <= n; ++i)
	{
		for (int j = i; j <= n; j += i)
		{
			sets[i][j] = 1;
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	cin >> n >> m >> q;

	sets = vector<bitset<MAX_N>>(n + m + 1, bitset<MAX_N>());
	initNSets();

	for (int i = 0; i < m; ++i)
	{
		const int idx = n + 1 + i;

		cin >> o;

		if (o == 3)
		{
			cin >> x;

			sets[idx] = ~sets[x];

			continue;
		}

		cin >> x >> y;

		if (o == 1)
		{
			sets[idx] = sets[x] | sets[y];
		}
		else
		{
			sets[idx] = sets[x] & sets[y];
		}
	}

	for (int i = 0; i < q; ++i)
	{
		cin >> x >> v;

		cout << (sets[x][v] ? "TAK" : "NIE") << "\n";
	}

	return 0;
}