题目链接: 2154. 梦幻布丁
题解
启发式合并入门,将颜色种类少的合并到多的那一类,pla统计每种颜色的各个位置。
有时候会出现要将颜色个数多的合并到小的,所以要交换颜色,因此本题用col来统计每个颜色的真实颜色。
代码
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<unordered_set>
#include<unordered_map>
using namespace std;
//extern "C"{void *__dso_handle=0;}
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define lowbit(x) x&-x
const double PI=acos(-1.0);
const double eps=1e-6;
const ll mod=1e9+7;
const int inf=0x3f3f3f3f;
const int maxn=1e5+10;
const int maxm=1e6+10;
#define ios ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int col[maxm],ans,a[maxn];
vector<int> pla[maxm];
void merge(int x,int y) //x小 y大
{
if(!pla[x].size()) return ;
for(int i=0;i<pla[x].size();i++) ans -= ((a[pla[x][i]-1]==y) + (a[pla[x][i]+1]==y));
for(int i=0;i<pla[x].size();i++) { a[pla[x][i]]=y; pla[y].push_back(pla[x][i]); }
pla[x].clear();
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
{
scanf("%d",&a[i]);
col[a[i]]=a[i];
if(a[i]!=a[i-1]) ans++;
pla[a[i]].push_back(i);
}
while (m--) {
int opt; scanf("%d",&opt);
if(opt==2) printf("%d\n",ans);
else
{
int x,y; scanf("%d%d",&x,&y);
if(x==y) continue;
if(pla[col[x]].size()>pla[col[y]].size()) swap(col[x], col[y]);
merge(col[x],col[y]);
}
}
}