codeforce 731C Socks(并查集+贪心)

本文链接：https://blog.csdn.net/m0_37134257/article/details/75432249

Arseniy is already grown-up and independent. His mother decided to leave him alone for m days and left on a vacation. She have prepared a lot of food, left some money and washed all Arseniy's clothes.

Ten minutes before her leave she realized that it would be also useful to prepare instruction of which particular clothes to wear on each of the days she will be absent. Arseniy's family is a bit weird so all the clothes is enumerated. For example, each of Arseniy's n socks is assigned a unique integer from 1 to n. Thus, the only thing his mother had to do was to write down two integers li and ri for each of the days — the indices of socks to wear on the day i (obviously, li stands for the left foot and ri for the right). Each sock is painted in one of kcolors.

When mother already left Arseniy noticed that according to instruction he would wear the socks of different colors on some days. Of course, that is a terrible mistake cause by a rush. Arseniy is a smart boy, and, by some magical coincidence, he posses k jars with the paint — one for each of k colors.

Arseniy wants to repaint some of the socks in such a way, that for each of m days he can follow the mother's instructions and wear the socks of the same color. As he is going to be very busy these days he will have no time to change the colors of any socks so he has to finalize the colors now.

The new computer game Bota-3 was just realised and Arseniy can't wait to play it. What is the minimum number of socks that need their color to be changed in order to make it possible to follow mother's instructions and wear the socks of the same color during each of m days.

Input

The first line of input contains three integers n, m and k (2 ≤ n ≤ 200 000, 0 ≤ m ≤ 200 000, 1 ≤ k ≤ 200 000) — the number of socks, the number of days and the number of available colors respectively.

The second line contain n integers c1, c2, ..., cn (1 ≤ ci ≤ k) — current colors of Arseniy's socks.

Each of the following m lines contains two integers li and ri (1 ≤ li, ri ≤ n, li ≠ ri) — indices of socks which Arseniy should wear during the i-th day.

Output

Print one integer — the minimum number of socks that should have their colors changed in order to be able to obey the instructions and not make people laugh from watching the socks of different colors.

Note

In the first sample, Arseniy can repaint the first and the third socks to the second color.

In the second sample, there is no need to change any colors.

要求每天穿的颜色一样，如果不一样，染成一样的，然后与这只很多相关的袜子，染色情况就会改变，对于这种情况，就要用到并查集，将相关联的袜子放在同一个集合中考虑

那么，关于这个集合，其中的袜子颜色肯定要都染成一个颜色，怎么染最小？

当然是用集合中元素个数-相同颜色最多的个数

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
const int N=200005;
const int inf=0x3f3f3f3f;
int f[N],n,m,k,ans,color[N];
vector<int>v[N];
void init()
{
    for(int i=1;i<=n;i++)
        f[i]=i;
}
int getf(int x)
{
    if(f[x]==x)return x;
    f[x]=getf(f[x]);
    return f[x];
}
void mix(int x,int y)
{
    int tx=getf(x);
    int ty=getf(y);
    if(tx!=ty)
    {
        f[tx]=ty;
    }
}
int main()
{
    int x,y;
    scanf("%d%d%d",&n,&m,&k);
    init();
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&color[i]);
    }
    for(int i=0;i<m;i++)
    {
        scanf("%d%d",&x,&y);
        mix(x,y);
    }
    for(int i=1;i<=n;i++)
    {
        v[getf(i)].push_back(color[i]);//把每一个颜色，加入合并后的子集里
    }
    for(int i=1;i<=n;i++)
    {
        if(v[i].size()<=1)continue;//子集中元素数量小于等于1，表示没有，或只有一种颜色，此时不用染色
        map<int,int>book;
        int maxx=0;
        for(int j=0;j<v[i].size();j++)
        {
            book[v[i][j]]++;
            maxx=max(maxx,book[v[i][j]]);//找出子集中相同颜色的最大个数
        }
        ans+=v[i].size()-maxx;//把其他颜色都染成相同颜色最多的即为最小
    }
    printf("%d\n",ans);
    return 0;
}