AcWing 2154. 梦幻布丁【启发式合并】

题目链接

题意

有 $N$ 个点，每个点有一种颜色，有两种操作

1. 将所有颜色为 $X$ 的点改为颜色 $Y$
2. 询问有多少段颜色

题解

启发式合并，对于修改操作，个数少的颜色改为个数多的颜色，最多修改log次

#include<iostream>
#include<sstream>
#include<string>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<vector>
#include<stack>
#include <utility>
#include<list>
#include<bitset>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<iomanip>
#include<time.h>
#include<random>
using namespace std;
#include<ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
using namespace __gnu_pbds;
#include<ext/rope>
using namespace __gnu_cxx;

#define int long long
#define PI acos(-1.0)
#define eps 1e-9
#define lowbit(a) ((a)&-(a))
#define mid ((l+r)>>1)
const int mod = 1e9+7;
int qpow(int a,int b){
	int ans=1;
	while(b){
		if(b&1)ans=(ans*a)%mod;
		a=(a*a)%mod;
		b>>=1;
	}
	return ans;
}
const int INF = 0x3f3f3f3f;
const int N = 1e5+10;
int col[N];
struct node{
	int id,next;
}a[N];
int head[N*10],cnt,sz[N*10],f[N*10],ans;
int add(int u,int id){
	a[++cnt]={id,head[u]},head[u]=cnt,sz[u]++;
}
void merge(int &x,int &y){
	if(x==y)return;
	if(sz[x]>sz[y]) swap(x,y);
	for(int i=head[x];i;i=a[i].next){
		int id=a[i].id;
		ans-=(col[id-1]==y)+(col[id+1]==y);
	}
	for(int i=head[x];i;i=a[i].next){
		int id=a[i].id;
		col[id]=y;
		if(a[i].next==0){
			a[i].next=head[y],head[y]=head[x];
			break;
		}
	}
	head[x]=0;
	sz[y]+=sz[x],sz[x]=0;
}
#define endl '\n'
signed main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int n,m; cin>>n>>m;
	for(int i=1;i<=n;i++){
		cin>>col[i];
		add(col[i],i);
		if(col[i]!=col[i-1])ans++;
	}
	for(int i=1;i<N*10;i++) f[i]=i;
	while(m--){
		int x,y,op; cin>>op;
		if(op==1){
			cin>>x>>y;
			merge(f[x],f[y]);
		}
		else cout<<ans<<endl;
	}
}