UvaSolution/uva429Word Transformation.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
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#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 mp(i,j) make_pair(i,j)
#define mstn(n) memset(n,-1,sizeof(n))
#define infile freopen("in.txt","r",stdin)
#define outfile freopen("out.txt","w",stdout)
#define ull unsigned long long
#define V 1000001
#define sz 1005
#define mod 1000000007
using namespace std;

class graph
{
public:
    int n,dest;
    vector<int> *adlist;
    bool *vis;
    graph(int n)
    {
        this->n = n;
        adlist = new vector<int>[n];
        vis = new bool[n];
    }
    void resetAll()
    {
        for(int i=0; i<n; i++) vis[i] = false;
    }
    void addEdge(int u,int v)
    {
        adlist[u].push_back(v);
        adlist[v].push_back(u);
    }

    int bfs(int from,int dest)
    {
        resetAll();
        int dist[n];
        mst(dist);
        vis[from] =1;
        queue<int> q;
        q.push(from);
        while(!q.empty())
        {
            int top = q.front();
            q.pop();
            int siz = adlist[top].size();
            for(int i=0; i<siz; i++)
            {
                int v = adlist[top][i];
                if(!vis[v])
                {
                    vis[v] = true;
                    dist[v] = dist[top]+1;
                    q.push(v);
                    if(v==dest) return dist[v];
                }
            }
        }
    }
};
int numOfMismatch(string a,string b)
{
    int len = a.length();
    int dif = 0;
    for(int i=0; i<len; i++)
    {
        if(a[i]!=b[i]) dif++;
    }
    return dif;
}
int main()
{
    bool nel = false;
    int test,kase = 1;
    sf(test);
    while(test--)
    {
        if(nel) nl;
        nel =true;
        int node=0,e,i=0;
        string str;
        vector<string> strList[10+1];
        map<string,int> imap;
        while(1)
        {
            cin>>str;
            imap[str] = i++;
            node++;
            strList[str.length()].push_back(str);
            if(str=="*") break;
        }
        graph g(node);
        for(int i=1; i<=10; i++)
        {
            int siz = strList[i].size();
            for(int j=0; j<siz; j++)
            {
                for(int k=0; k<j; k++)
                {
                    if(numOfMismatch(strList[i][j],strList[i][k])==1)
                    {
                        g.addEdge(imap[strList[i][j]],imap[strList[i][k]]);
                    }
                }

            }
        }
        getchar();
        while(1)
        {
            getline(cin,str);
            if(str.length()==0) break;
            stringstream ss(str);
            string s1,s2;
            ss>>s1>>s2;
            cout<<s1<<" "<<s2<<" "<<g.bfs(imap[s1],imap[s2])<<endl;
        }

    }
}