【NOIP 2002】 字串变换

【题目链接】

https://www.luogu.org/problemnew/show/P1032

【算法】

广度优先搜索

用stl库里的map来判重

【代码】

#include<bits/stdc++.h>
using namespace std;

int n;
string A,B;
string s1[],s2[];
map<string,bool> mp;

inline bool bfs()
{
        int i,pos;
        queue< pair<string,int> > q;
        pair<string,int> cur;
        string tmp;
        q.push(make_pair(A,));
        while (!q.empty())
        {
                cur = q.front();
                q.pop();
                if (cur.second > ) return false;
                if (cur.first == B)
                {
                        printf("%d\n",cur.second);
                        return true;
                }
                for (i = ; i <= n; i++)
                {
                        if (cur.first.find(s1[i]) == string :: npos) continue;
                        pos = cur.first.find(s1[i]);
                        while (true)
                        {
                                tmp = cur.first;
                                tmp.replace(pos,s1[i].length(),s2[i]);
                                if (!mp[tmp])
                                {
                                        q.push(make_pair(tmp,cur.second+));
                                        mp[tmp] = true;
                                }
                                if (cur.first.find(s1[i],pos+) == string :: npos) break;
                                pos = cur.first.find(s1[i],pos+);
                        }
                }
        }
}

int main()
{

        cin >> A >> B;
        n = ;
        while (cin >> s1[n] >> s2[n]) n++;
        if (!bfs()) printf("NO ANSWER!\n");

        return ;

}