100分hack（1.04s)被卡时了，求调

#include<bits/stdc++.h>
using namespace std;
#define int long long
// const int N=1000010;
#define N 1001000
int n,m,opt,x,a[N],y,mfans,ans[N];
vector<int> edge[N];
inline void merge(int mfx,int mfy){
	if(edge[mfx].size()>edge[mfy].size()) swap(edge[mfx],edge[mfy]);
    for(int i=0;i<(int)edge[mfx].size();++i){
        int mff=edge[mfx][i];
		edge[mfy].insert(lower_bound(edge[mfy].begin(),edge[mfy].end(),mff),mff);
	}
	edge[mfx].clear(),mfans=mfans-ans[mfx]-ans[mfy];
	ans[mfx]=0,ans[mfy]=1;
	for(int i=1;i<(int)edge[mfy].size();++i) if(edge[mfy][i]!=edge[mfy][i-1]+1) ++ans[mfy];
	mfans+=ans[mfy];
	return ;
}
signed main(){
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>n>>m;
	for(int i=1;i<=n;++i){
		cin>>a[i];
		edge[a[i]].push_back(i);
		if(a[i]!=a[i-1]) ++ans[a[i]],++mfans;
	}
    while(m--){
        // for(int i=1;i<=m;++i){
		cin>>opt;
		if(opt&1){
			cin>>x>>y;
			if(x==y||edge[x].empty()) continue;
			merge(x,y);
		}
		else cout<<mfans<<'\n';
	}
	return 0;
}