Competitive Programming

#include <bits/stdc++.h>
#define INF 0x3F3F3F3F
using namespace std;

const int MAXN = 50;

struct edge{
  int from, to, weight;
  edge(){}
  edge(int a, int b, int c){
    from = a;
    to = b;
    weight = c;
  }
  bool operator<(const edge &other)const{ // sobrecarga de operadores para ordenar
    return weight < other.weight;
  }
};

struct UF{
    int parents[MAXN];
    int sz[MAXN];
    int components;
    int mst_sum;
    UF(int n){
        for(int i=0;i<n;i++){
            parents[i] = i; sz[i] = 1;
        }
        components = n;
        mst_sum = 0;
    }
    int find(int n){
        return n == parents[n] ? n : find(parents[n]);
    }
    bool isConnected(int a, int b){
        return find(a) == find(b);
    }
    void connect(int a, int b, int weight){
        if(isConnected(a, b)) return;
        int A,B; A = find(a); B = find(b);
        if(sz[A] > sz[B]){
            parents[B] = A;
            sz[A] += sz[B];
        }
        else{
            parents[A] = B;
            sz[B] += sz[A];
        }
        mst_sum += weight;
        components--;
    }
};

int main(){
    int cases; cin>>cases;
    getchar();
    getchar();
    while(cases--)
    {
    char N1; cin>>N1; int N=N1-65;
    vector<edge> edges;
    UF uf = UF(N+1);
    string line;
    cin.ignore();
    while(getline(cin,line))
    {
    if(line.length()!=2) break;
    edges.push_back(edge(line[0]-65,line[1]-65,1));
    }
      sort(edges.begin(), edges.end());
      for(unsigned int i=0;i<edges.size();i++) uf.connect(edges[i].from, edges[i].to, edges[i].weight);
      printf("%d\n",uf.components);
      if(cases!=0) printf("\n");
    }
  return 0;
}