CodeForces 731C Socks 并查集+map计数

本文链接：https://blog.csdn.net/fans_ac/article/details/53256185

Socks

Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Appoint description:

Description

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 l_i and r_i for each of the days — the indices of socks to wear on the day i (obviously, l_i stands for the left foot and r_i for the right). Each sock is painted in one of k colors.

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 mdays.

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 c₁, c₂, ..., c_n (1 ≤ c_i ≤ k) — current colors of Arseniy's socks.

Each of the following m lines contains two integers l_i and r_i (1 ≤ l_i, r_i ≤ n, l_i ≠ r_i) — 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.

Sample Input

Input

Output

Input

Output

Hint

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.

题意：给n只袜子的，最多k个颜色，一共m天，每天都要穿某两只袜子。

但是不能让某一天穿不同颜色的袜子。

问至少改变多少只袜子的颜色能满足这m天的要求。

解题思路：

需要同一天穿的袜子可以用并查集放到一起。

那么所有要求颜色一样的袜子就放在一起了。

然后找出这一堆袜子中最多的那种颜色。（用map计数）

然后用size-maxcolor即为这堆袜子至少要改的次数。

刚开始统计一堆袜子中最多的颜色用了一个计数数组直接超时，这个功能可以用map直接实现。

还有，scanf比cin快，做题不用cin

#include<bits/stdc++.h>
using namespace std;
const int maxn = 2e5+5 ;
int color[maxn] ;
int pa[maxn] ;
//int cnt[maxn] ;
vector<int>qq[maxn];
int findset(int x){return x==pa[x]?x:pa[x]=findset(pa[x]) ;}
int main(){
    int n,m,k;
    std::ios::sync_with_stdio(false);
    while(cin>>n>>m>>k){//~scanf("%d%d%d",&n,&m,&k)){//
        for(int i=1;i<=n;i++){
            cin>>color[i];
            //scanf("%d",&color[i]);
        }
        for(int i=1;i<=n;i++)pa[i]=i;
        for(int i=1;i<=m;i++){
            int a,b;
            cin>>a>>b;
            //scanf("%d%d",&a,&b);
            int u=findset(a);
            int v=findset(b);
            if(u!=v){
                pa[u]=v;
            }
        }
        for(int i=1;i<=n;i++)qq[i].clear() ;
        for(int i=1;i<=n;i++){
            qq[findset(i)].push_back(color[i]) ;
        }


        int c=1;
        int maxx=0;
        int ans=0;
        for(int i=1;i<=n;i++){
            if(qq[i].size()!=0){
                maxx=0;
                map<int,int>mp ;
                mp.clear() ;
                for(int j=0;j<qq[i].size();j++){
                    if(mp.count(qq[i][j])==0){
                        mp[qq[i][j]]++ ;
                        maxx=max(maxx,1);
                    }else{
                        ++mp[qq[i][j]];
                        maxx=max(maxx,mp[qq[i][j]]) ;
                    }
                }
                ans+=(qq[i].size()-maxx);
            }

        }
        printf("%d\n",ans);
    }
    return 0;
}