FilesExpand file tree

 master

/

FindAndUnion.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

29 lines (23 loc) · 410 Bytes

 master

/

FindAndUnion.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

29 lines (23 loc) · 410 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include <bits/stdc++.h>

using namespace std;

const int N = 1e6, NT = N + 2;

int Rep[NT], Ile[NT];

int Find(int a) {

if (Rep[a] != a)

Rep[a] = Find(Rep[a]);

return Rep[a];

}

void Union(int a, int b) {

a = Find(a);

b = Find(b);

if (Ile[a] > Ile[b])

swap(a, b);

Rep[a] = b;

Ile[b] += Ile[a];

}

void Init(int n) {

for (int i = 1; i <= n; i++) {

Rep[i] = i;

Ile[i] = 1;

}

}