从起点往终点单向搜索,最坏情况状态数会达6^10,这明显会T。而往终点搜索的同时,也可以从终点向起点搜索,两个搜索同时进行,此时最坏情况的状态数为2*6^5,大大优化了时间。
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for(int i = a;i<n;i++)
#define per(i,a,n) for(int i = n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl '\n';
#define R register
typedef vector<int> VI;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll MOD=1000000007;
int rnd(int x) {return mrand() % x;}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;};
ll lcm(int a,int b){return a*b/gcd(a,b);};
int n;
string x,y;
string a[6],b[6];
int extend(queue<string>& q,unordered_map<string,int>& pa,unordered_map<string,int>& pb,string a[],string b[]){
auto t=q.front();
q.pop();
rep(i,0,SZ(t)){
rep(j,0,n){
if(t.substr(i,SZ(a[j]))==a[j]){
string stu=t.substr(0,i)+b[j]+t.substr(i+SZ(a[j]));
if(pb.count(stu)) return pa[t]+1+pb[stu];
if(!pa.count(stu)){
pa[stu]=pa[t]+1;
q.push(stu);
}
}
}
}
return 11;
}
int bfs(){
queue<string> qa,qb;
unordered_map<string,int> pa,pb;
qa.push(x),qb.push(y);
pa[x]=0,pb[y]=0;
while(!qa.empty()&&!qb.empty()){
int t;
if(SZ(qa)<=SZ(qb)){
t=extend(qa,pa,pb,a,b);
}else{
t=extend(qb,pb,pa,b,a);
}
if(t<=10) return t;
}
return 11;
}
int main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>x>>y;
while(cin>>a[n]>>b[n]) n++;
if(x==y){
cout<<0<<endl;
return 0;
}
int k=bfs();
if(k>10) puts("NO ANSWER!");
else cout<<k<<endl;
return 0;
}
时间复杂度:O(),n为字符串长度,c为替换规则数
空间复杂度:O()