UvaSolution/uva_459_Graph_Connectivity.cpp at master · Masum95/UvaSolution · 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
73
74
75
76
77
78
#include<bits/stdc++.h>
#define pb(n) push_back(n)
#define bug cout<<"bug";
#define all(c) c.begin(),c.end()
#define fr(i,n) for(i=0;i<n;i++)
#define sf(n) scanf("%d",&n)
#define mst(n) memset(n,0,sizeof(n))
#define nl printf("\n")
#define lli long long int
#define tr(container,it) \
    for (auto it = container.begin(); it != container.end() ; ++it)

#define INF INT_MAX
#define MOD 1000000007
#define mp(i,j) make_pair(i,j)
#define infile freopen("in.txt","r",stdin)
#define outfile freopen("out.txt","w",stdout)
#define pr(a) cout<<cout<<a.a.first<<"  "<< a.a.second<<endl
#define V 5
using namespace std;
vector<int> adlist[26+1];
bool vis[26+1];
int dfsUtil(int st)
{
    vis[st]=1;
    for(int i=0; i<adlist[st].size(); i++)
    {
        if(!vis[adlist[st][i]])
        {
            dfsUtil(adlist[st][i]);
        }
    }
}
int dfs(int top)
{
    int cnt=0;
    for(int i=1; i<=top; i++)
    {
        if(!vis[i])
        {
            dfsUtil(i), cnt++;
        }

    }
    return cnt;
}
int main()
{

    int test;
    char str[5];
    scanf("%d\n",&test);

    bool nel=0;
    while(test--)
    {
        if(nel) nl;
        nel=1;
        gets(str);
        int top=str[0]-'A'+1;
        mst(vis);
        for(int i=1; i<=26; i++) adlist[i].clear();
        while(gets(str))
        {

            if(strlen(str)==0) break;
            int a1=str[0]-'A'+1,a2=str[1]-'A'+1;

            adlist[a1].pb(a2), adlist[a2].pb(a1);

        }
        int ret=dfs(top);
        printf("%d\n",ret);


    }
}