hacktoberfest/dsu.cpp at master · abhi5459/hacktoberfest · GitHub

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
#include<iostream>
using namespace std;

int sum[100],par[100];

int parent(int i)
{
	if(par[i]!=i)
	{
		int x = parent(par[i]);
		par[i] = x;
		return x;
	}
	else
		return i;
}


int un(int a, int b)
{
	int ra = parent(a);
	int rb = parent(b);

	//merge
	if(sum[ra]>sum[rb])
	{
		par[rb] = ra;
		sum[ra] += sum[rb];
	}
	else
	{
		par[ra] = rb;
		sum[rb] += sum[ra];
	}
}

int main()
{
	int n;
	cin >> n;

	// initializing arrays
	int i;
	for(i=0;i<=n;i++)
	{
		par[i] = i;
		sum[i] = 1;
	}


	int q;
	cin >> q;
	while(q--)
	{
		int type;
		cin >> type;
		if(type==1) // find parent
		{
			int a;
			cin >> a;
			cout << parent(a) << endl;
		}
		else // join a and b nodes
		{
			int a,b;
			cin >> a >> b;
			un(a,b);
		}
	}


}