p1199八数码问题

oj上简化的八数码问题，最强的数据仅仅是20步；

根据曼哈顿距离构造启发函数；

主算法：IDA*；(使用方法好像不太对......)

未用位运算优化；

 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<string>
 #include<ctime>
 #include<cmath>
 #include<set>
 #include<map>
 #include<queue>
 #include<algorithm>
 #include<iomanip>
 #include<queue>
 using namespace std;
 #define FILE "dealing"
 #define up(i,j,n) for(int i=(j);i<=(n);i++)
 #define pii pair<int,int>
 #define LL long long
 namespace IO{
     char buf[<<],*fs,*ft;
     int gc(){return (fs==ft&&(ft=(fs=buf)+fread(buf,,<<,stdin),fs==ft))?-:*fs++;}
     int read(){
         int ch=gc(),f=,x=;
         while(ch<''||ch>''){if(ch=='-')f=;ch=gc();}
         while(ch>=''&&ch<=''){x=(x<<)+(x<<)+ch-'';ch=gc();}
         return f?-x:x;
     }
 }using namespace IO;
 const int maxn=;
 char ch[maxn],en[maxn]={'','','','','','','','',''};
 int a[][];
 int p[][]={
 {,,,,,,,,},
 {,,,,,,,,},
 {,,,,,,,,},
 {,,,,,,,,},
 {,,,,,,,,},
 {,,,,,,,,},
 {,,,,,,,,},
 {,,,,,,,,},
 {,,,,,,,,}
 };
 int x[],y[];
 inline int check(int a[][]){
     int ans=;
     up(i,,)x[a[][i-]]=i-;
     up(i,,)x[a[][i-]]=i-;
     up(i,,)x[a[][i-]]=i-;
     up(i,,)ans+=p[x[i]][y[i]];
     return ans;
 }
 const int dx[]={,,,-},dy[]={,-,,};
 bool flag=;
 int ans=;
 int MaxH=;
 void dfs(int a[][],int d){
     int xx,yy;
     xx=check(a);
     if(!xx){flag=;ans=min(ans,d);return;}
     if(d+xx>MaxH)return;
     up(i,,)up(j,,){
         if(a[i][j])continue;
         up(k,,){
             xx=i+dx[k],yy=j+dy[k];
             if(xx<||yy<||xx>||yy>)continue;
             swap(a[xx][yy],a[i][j]);
             dfs(a,d+);
             swap(a[xx][yy],a[i][j]);
         }
     }
     return;
 }
 int main(){
     freopen(FILE".in","r",stdin);
     freopen(FILE".out","w",stdout);
     scanf("%s",ch);
     up(i,,)y[en[i]-'']=i;
     up(i,,)a[][i-]=ch[i-]-'';up(i,,)a[][i-]=ch[i-]-'';up(i,,)a[][i-]=ch[i-]-'';
     for(int i=;;i+=){
         MaxH=i;
         dfs(a,);
         if(flag)break;
     }
     printf("%d\n",ans);
     cout<<"The time has passed "<<clock()<<" ms."<<endl;
     return ;
 }