先附题!
算法:
IDA*算法,设g[x]为当前已走步数+还未还原的格子个数
AC程序:
#include<bits/stdc++.h>
using namespace std;
const int dir[8][2]={{1,2},{1,-2},{-1,2},{-1,-2}
,{2,1},{2,-1},{-2,1},{-2,-1}};
class WZY{
public:
inline int read(){
char c=getchar();int num=0;int f=1;
while(c<'0'||c>'9'){if(c=='-')f=-1;c=getchar();}
while(c>='0'&&c<='9'){num=num*10+(c-'0');c=getchar();}
return num*f;
}
inline void qwq(int x){
if(x>9)qwq(x/10);
putchar(x%10+'0');
}
inline void write(int x){
if(x<0){x=-x;putchar('-');}
qwq(x);putchar('\n');
}
}wzy;
int v[6][6];
bool flag=false;
int ans=0;
bool pass_f(int s){
int number=0;
for(int i=1;i<=5;i++){
for(int j=i+(i>2);j<=5;j++){if(v[i][j]!=2)number++;if(number+s>ans)return false;}
}
if(v[3][3]!=0)number++;
if(number+s>ans)return false;
for(int i=2;i<=5;i++){
for(int j=1;j<=i-1+(i>3);j++){if(v[i][j]!=1)number++;if(number+s>ans)return false;}
}
return true;
}
bool reach_answer(){
for(int i=1;i<=5;i++){
for(int j=i+(i>2);j<=5;j++){if(v[i][j]!=2)return false;}
}
if(v[3][3]!=0)return false;
for(int i=2;i<=5;i++){
for(int j=1;j<=i-1+(i>3);j++){if(v[i][j]!=1)return false;}
}
return true;
}
void A_star(int x,int y,int depth){
if(depth>ans)return;
if(reach_answer()){
if(depth==ans)flag=true;
return;
}
for(int i=0;i<8;i++){
int tx=x+dir[i][0];int ty=y+dir[i][1];
if(tx<1||tx>5||ty<1||ty>5)continue;
swap(v[x][y],v[tx][ty]);
if(pass_f(depth))A_star(tx,ty,depth+1);
swap(v[x][y],v[tx][ty]);
if(flag==true)return;
}
return;
}
int main(){
int T=wzy.read();
for(int s=1;s<=T;s++){
int bx,by;
for(int i=1;i<=5;i++){
for(int j=1;j<=5;j++){
char c;cin>>c;
if(c!='*')v[i][j]=c-'0'+1;
else{v[i][j]=0;bx=i;by=j;}
}
}
flag=false;
for(ans=0;ans<=15;ans++){
A_star(bx,by,0);
if(flag==true){wzy.write(ans);break;}
}
if(!flag)wzy.write(-1);
}
return 0;
}
水水尧JSOI2018 Summer Camp提高1班被碾压记系列第3篇博客~~~