UVa-solutions/429.cpp at master · amitpriyankar/UVa-solutions · 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
79
80
81
82
83
84
85
86
87
88
#include <bits/stdc++.h>
using namespace std;
bool check(string s,string t)
{
    int ct=0;
    for(int i=0; i<s.size(); i++)
    {
        if(s[i]!=t[i])ct++;
    }
    if(ct==1)return true;
    else return false;
}
void solve()
{
    vector<int> adj[205];
    vector<bool> visited(205,false);
    unordered_map<string,int> mp;
    string arr[205];
    string s;
    int t=0;
    while(getline(cin,s))
    {
        if(s=="*")
        {
            string t1,t2;
            string st;
            while(getline(cin,st)&&st!="")
            {
                stringstream ss(st);
                ss>>t1>>t2;
                int aa=mp[t1];
                int bb=mp[t2];
                visited.assign(205,false);
                vector<int> d(205,0);
                queue<int> q;
                q.push(aa);
                visited[aa]=true;
                while(!q.empty())
                {
                    int v=q.front();
                    q.pop();
                    for(int u:adj[v])
                    {
                        if(!visited[u])
                        {
                            visited[u]=true;
                            q.push(u);
                            d[u]=d[v]+1;
                        }
                    }
                }
                cout<<t1<<" "<<t2<<" "<<d[bb]<<endl;
            }
          //  cout<<endl;
            return ;


        }
        else
        {
            arr[++t]=s;
             mp[s]=t;
            for(int i=1; i<t; i++)
            {
                if(arr[t].size()==arr[i].size()&&check(arr[i],arr[t]))
                {
                    adj[mp[arr[t]]].push_back(mp[arr[i]]);
                    adj[mp[arr[i]]].push_back(mp[arr[t]]);
                }
            }
        }

    }
}
int main()
{
    int T;
    cin>>T;
    string s;
        getline(cin,s);
    while(T--)
    {

        solve();
        if(T!=0)cout<<endl;

    }
}