uva-solution/459 - Graph Connectivity.cpp at master · fkshohag/uva-solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include<iostream>
#include<cstdio>
#include<cstring>
#define max 1111
using namespace std;
int par[max],count=0;
void makeset(int n)
{
    int i;
    for(i=0;i<=n;i++)
    {
        par[i]=i;
    }
}

int find_friend(int n)
{
    if(par[n]==n)
    {
        return n;
    }
    else
    {
        return (par[n]=find_friend(par[n]));
    }
}

void make_friend(int u,int v)
{
    int U=find_friend(u);
    int V=find_friend(v);
    if(U!=V)
    {
        par[U]=V;
        count--;
    }
}

int main()
{
    char str[max],ch;

    int len,i,j,k,cas,x,a,b;

    scanf("%d",&cas);
    getchar();
    getchar();
    for(k=1;k<=cas;k++)
    {

        scanf("%c",&ch);
        getchar();
        x = ch-64;
        makeset(x);
        count = x;
        while(gets(str))
        {
            if(str[0]=='\0')
                break;
            a = str[0]-64;
            b = str[1]-64;

            make_friend(a,b);
        }
        if(k!=1)
            printf("\n");

        printf("%d\n",count);

    }
    return 0;
}