Template/bingchaji.cpp at master · nike0good/Template · 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
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<functional>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define Lson (x<<1)
#define Rson ((x<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define MAXN (3*50000+10)
long long mul(long long a,long long b){return (a*b)%F;}
long long add(long long a,long long b){return (a+b)%F;}
long long sub(long long a,long long b){return (a-b+(a-b)/F*F+F)%F;}
typedef long long ll;
class bingchaji
{
public:
	int father[MAXN],n,cnt;
	void mem(int _n)
	{
		n=cnt=_n;
		For(i,n) father[i]=i;
	}
	int getfather(int x)
	{
		if (father[x]==x) return x;

		return father[x]=getfather(father[x]);
	}
	void unite(int x,int y)
	{
		x=getfather(x);
		y=getfather(y);
		if (x^y) {
			--cnt;
			father[x]=y;
			sz[y]+=sz[x];
		}
	}
	bool same(int x,int y)
	{
		return getfather(x)==getfather(y);
	}
}S;

int main()
{
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);

	return 0;
}