题面

#include <map>
#include <ctime>
#include <queue>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int n=5;
int ans[100010];
struct node{
  string s;
  int cnt;
  int u1,u2;
  node(string s="",int cnt=0,int u1=0,int u2=0):s(s),cnt(cnt),u1(u1),u2(u2){}
};
queue<node> q;
int toint(string s){
  int ret=0;
  for(int i=0;i<n;i++) ret=ret*10-48+s[i];
  return ret;
}
void bfs(){
  q.push(node("12345",0));
  ans[12345]=0;
  while(!q.empty()){
    node now=q.front();q.pop();
    //cout<<now.s<<" "<<now.cnt<<" "<<now.u1<<" "<<now.u2<<endl;
    //1
    for(int i=0;i<n-1;i++){
      string tmp=now.s;
      swap(tmp[i],tmp[i+1]);
      int t=toint(tmp);
      if(ans[t]==-1) q.push(node(tmp,now.cnt+1,now.u1,now.u2)),ans[t]=now.cnt+1;
    }
    //2
    if(now.u1<3)for(int i=0;i<n;i++){
      string tmp=now.s;
      tmp[i]=((tmp[i]-'0')+1)%10+'0';
      int t=toint(tmp);
      if(ans[t]==-1) q.push(node(tmp,now.cnt+1,now.u1+1,now.u2)),ans[t]=now.cnt+1;
    }
    //3
    if(now.u2<2)for(int i=0;i<n;i++){
      string tmp=now.s;
      tmp[i]=((tmp[i]-'0')*2)%10+'0';
      int t=toint(tmp);
      if(ans[t]==-1) q.push(node(tmp,now.cnt+1,now.u1,now.u2+1)),ans[t]=now.cnt+1;
    }
  }
}
int x;
int main(){
  ios::sync_with_stdio(0),cin.tie(0);
  memset(ans,-1,sizeof ans);
  bfs();
  while(cin>>x){
    cout<<ans[x]<<'\n';
  }
  return 0;
}
// for(map<string,int>::iterator it=ans.begin();it!=ans.end();++it){
  //   cout<<it->first<<" "<<it->second<<endl;
  // }
/*
//1
    for(int i=0;i<n-1;i++){
      node tmp=now;
      swap(tmp.s[i],tmp.s[i+1]);
      tmp.cnt++;
      if(ans.find(tmp.s)==ans.end()) q.push(tmp),ans[tmp.s]=tmp.cnt;
    }
    //2
    for(int i=0;i<n;i++){
      node tmp=now;
      int num=tmp.s[i]-'0';
      num=(num+1)%10;
      tmp.s[i]='0'+num;
      tmp.cnt++;
      if(ans.find(tmp.s)==ans.end()) q.push(tmp),ans[tmp.s]=tmp.cnt;
    }
    //3
    
*/