Ice cream

#include <bits/stdc++.h>
#define N 100001
#define ll long long

using namespace std;

int ic[N+1];
int gi[N+1];

set<int> cols[N+1];
vector<int> v[N+1];

void find(int i, int col) {
  if(gi[i]) return;
  gi[i] = col;
  cols[col].insert(ic[i]);

  for(auto neigh : v[i]) {
    find(neigh, col);
  }
}

int main() {
  ios_base::sync_with_stdio(0);

  int n, m;
  cin >> n >> m;
  for(int i=0;i<n;i++) {
    cin >> ic[i];
  }

  for(int i=0;i<m;i++) {
    int a, b;
    cin >> a >> b;
    a--; b--;
    v[a].push_back(b);
    v[b].push_back(a);
  }

  int gid = 1;
  for(int i=0;i<n;i++) {
    if(gi[i]) continue;
    find(i, gid);
    gid += 1;
  }
  
  for(int i=0;i<n;i++) {
    cout << cols[gi[i]].size() << endl;
  }

  return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED