0x41 [NOI2002] 银河英雄传说 （并查集）

都是些原来做过的题，发现是Pascal代码不敢放就再打了一遍

水

直接记录一下每个元素的头在哪里

用并查集维护就行了

#include <map>
#include <set>
#include <ctime>
#include <queue>
#include <stack>
#include <cmath>
#include <vector>
#include <bitset>
#include <cstdio>
#include <cctype>
#include <string>
#include <numeric>
#include <cstring>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <functional>
using namespace std ;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define loop(s, v, it) for (s::iterator it = v.begin(); it != v.end(); it++)
#define cont(i, x) for (int i = head[x]; i; i = e[i].nxt)
#define clr(a) memset(a, 0, sizeof(a))
#define ass(a, sum) memset(a, sum, sizeof(a))
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define iv inline void
#define enter cout << endl
#define siz(x) ((int)x.size())
#define file(s) freopen(s".in", "r", stdin), freopen(s."out", "w", stdout)
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair <int, int> pii ;
typedef vector <int> vi ;
typedef vector <pii> vii ;
typedef queue <int> qi ;
typedef set <int> si ;
typedef map <int, int> mii ;
typedef map <string, int> msi ;
const int N = 100010 ;
const int INF = 0x3f3f3f3f ;
const int iinf = 1 << 30 ;
const ll linf = 2e18 ;
const int MOD = 1000000007 ;
const double eps = 1e-7 ;
void print(int x) { cout << x << endl ; exit(0) ; }
void PRINT(string x) { cout << x << endl ; exit(0) ; }
void douout(double x){ printf("%lf\n", x + 0.0000000001) ; }

int fa[N], head[N], sz[N] ;
int T, x, y ;
string s ;

int find(int x) {
	if (fa[x] == x) return x ;
	int fat = find(fa[x]) ;
	head[x] += head[fa[x]] ;
	return fa[x] = fat ;
}

signed main(){
	scanf("%d", &T) ;
	rep(i, 1, 30000) fa[i] = i, head[i] = 0, sz[i] = 1 ;
    while (T--) {
    	cin >> s >> x >> y ;
    	int X = find(x), Y = find(y) ;
    	if (s[0] == 'M') {
			head[X] += sz[Y] ;
			fa[X] = Y ;
			sz[Y] += sz[X] ;
			sz[X] = 0 ;
		}
		else {
			if (X != Y) puts("-1") ;
			else printf("%d\n", abs(head[x] - head[y]) - 1) ;
		}
	}
	return 0 ;
}

/*
写代码时请注意：
	1.ll？数组大小，边界？数据范围？
	2.精度？
	3.特判？
	4.至少做一些
思考提醒：
	1.最大值最小->二分？
	2.可以贪心么？不行dp可以么
	3.可以优化么
	4.维护区间用什么数据结构？
	5.统计方案是用dp？模了么？
	6.逆向思维？
*/