Codeforces Round #376 (Div. 2) C 并查集

链接：戳这里

C. Socks

time limit per test:2 seconds

memory limit per test:256 megabytes

input:standard input

output:standard output

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

Examples

Input
3 2 3
1 2 3
1 2
2 3

Output
2

Input
3 2 2
1 1 2
1 2
2 1

Output
0

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.

题意：

给出n,m,k  表示n只袜子总共k种颜色，给出n只袜子的颜色，然后给出m天，每天穿的两只袜子颜色

现在要求改变袜子的颜色使得每天的袜子颜色一样且每天穿的袜子不变

需要注意每只袜子只会被穿一次

思路：

对于给出的m天对关系，则这些关系所有有关联的都是一个颜色

所以并查集找出所有的联通块

然后接下找出联通块里颜色最多的当成众色出现最多的颜色），拿每块联通块的大小减去众色

统计答案就可以了

代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<vector>
#include <ctime>
#include<queue>
#include<set>
#include<map>
#include<list>
#include<stack>
#include<iomanip>
#include<cmath>
#include<bitset>
#define mst(ss,b) memset((ss),(b),sizeof(ss))
///#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
#define INF (1ll<<60)-1
#define Max 1e9
using namespace std;
int fa[200100];
int Find(int x){
    if(x!=fa[x])
        fa[x]=Find(fa[x]);
    return fa[x];
}
vector<int> col[200100];
map<int,int> mp;
int n,m,k;
int a[200100];
int main(){
    scanf("%d%d%d",&n,&m,&k);
    for(int i=1;i<=n;i++) scanf("%d",&a[i]);
    for(int i=1;i<=n;i++) fa[i]=i;
    for(int i=1;i<=m;i++){
        int u,v;
        scanf("%d%d",&u,&v);
        int X=Find(u);
        int Y=Find(v);
        if(X!=Y) fa[X]=Y;
    }
    for(int i=1;i<=n;i++) int X=Find(i);
    for(int i=1;i<=n;i++){
        col[fa[i]].push_back(i);
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        if(col[i].size()==1) continue;
        int m=col[i].size();
        mp.clear();
        int mx=0;
        for(int j=0;j<m;j++){
            int x=col[i][j];
            mp[a[x]]++;
            mx=max(mp[a[x]],mx);
        }
        ///printf("m=%d mx=%d\n",m,mx);
        ans+=m-mx;
    }
    cout<<ans<<endl;
    return 0;
}

/*
3 0 1
1 1 1

*/