对每个颜色开个链表记录这个颜色每个布丁的位置,然后启发式合并链表,每次小的往大的合并,设小的链表大小
x
,每次合并复杂度是
记录一下每种颜色真实颜色是什么,如果一次染色是将一个大链表染向一个小链表,那就将两种颜色的真实颜色交换,仍然将小链表往大链表合并
code:
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
void read(int &x)
{
char c;while(!((c=getchar())>='0'&&c<='9'));
x=c-'0';
while((c=getchar())>='0'&&c<='9') x=(x<<3)+(x<<1)+c-'0';
}
const int maxn = 110000;
const int maxm = 1100000;
int n,m,a[maxn];
int head[maxm],nex[maxn],num[maxm];
int v[maxm],cnt;
int ans;
void merge(int x,int y)
{
if(x==y) return ;
if(num[v[x]]>num[v[y]]) swap(v[x],v[y]);
x=v[x],y=v[y];
if(!head[x])return ;
int la=0;
for(int i=head[x];i;la=i,i=nex[i])
{
if(a[i+1]==y) ans--;
if(a[i-1]==y) ans--;
}
for(int i=head[x];i;i=nex[i]) a[i]=y;
nex[la]=head[y],head[y]=head[x];
num[y]+=num[x]; num[x]=0;
head[x]=0;
}
int main()
{
scanf("%d%d",&n,&m);
ans=0;
for(int i=1;i<=n;i++)
{
int x; read(x);
a[i]=x; if(a[i-1]!=x) ans++;
nex[i]=head[x];
head[x]=i;
num[x]++;
v[x]=x;
}
while(m--)
{
int x; read(x);
if(x==1)
{
int y; read(x); read(y);
merge(x,y);
}
else printf("%d\n",ans);
}
return 0;
}