#ifndef UNION_FIND3_H_
#define UNION_FIND3_H_

#include<iostream>
#include<cassert>

namespace UF3
{
	class UnionFind
	{
	private:
		int* parent;
		int* sz;  //sz[i]就表示以i為根的集合中元素的個(gè)數(shù)
		int count;

	public:
		UnionFind(int count)
		{
			this->count = count;
			parent = new int[count]; 
			sz = new int[count];
			for(int i = 0 ; i < count ; i++)
			{
				parent[i] = i;
				sz[i] = 1;
			}

		}

		~UnionFind()
		{
			delete [] parent;
			delete [] sz;
		}

		int find(int p)
		{
			assert(p < count && p >= 0); 
			while( p != parent[p]) //這個(gè)是寫到find里面的
			{
				p = parent[p];
			}

			return p;
		}

		void unionElements(int p , int q)
		{

			int pRoot = find(p);
			int qRoot = find(q);

			if( pRoot == qRoot)
				return;
			if(sz[pRoot] < sz[qRoot])
			{
				parent[pRoot] = qRoot;
				sz[qRoot] += sz[pRoot];
			}
			else
			{
				parent[qRoot] = pRoot;
				sz[pRoot] += sz[qRoot];
			}

		}

		bool isConnected(int p , int q)
		{
			return find(p) == find(q);
		}


	};
};


#endif

#ifndef UNION_FIND4_H_
#define UNION_FIND4_H_

#include<iostream>
#include<cassert>

namespace UF4
{
	class UnionFind
	{
	private:
		int* parent;
		int* rank;  //rank[i]就表示以i為根的集合的層數(shù)
		int count;

	public:
		UnionFind(int count)
		{
			this->count = count;
			parent = new int[count]; 
			rank = new int[count];
			for(int i = 0 ; i < count ; i++)
			{
				parent[i] = i;
				rank[i] = 1;
			}

		}

		~UnionFind()
		{
			delete [] parent;
			delete [] rank;
		}

		int find(int p)
		{
			assert(p < count && p >= 0); 
			while( p != parent[p]) //這個(gè)是寫到find里面的
			{
				p = parent[p];
			}

			return p;
		}

		void unionElements(int p , int q)
		{

			int pRoot = find(p);
			int qRoot = find(q);

			if( pRoot == qRoot)
				return;
			if(rank[pRoot] < rank[qRoot])
			{
				parent[pRoot] = qRoot;
			}
			else if( rank[pRoot] > rank[qRoot] )
			{
				parent[qRoot] = pRoot;
			}
			else
			{
				parent[pRoot] = qRoot; //這里誰(shuí)指向誰(shuí)無(wú)所謂
				rank[qRoot] ++;
			}

		}

		bool isConnected(int p , int q)
		{
			return find(p) == find(q);
		}


	};
};


#endif