原题链接:https://vjudge.net/problem/UVA-1533
分类:状态压缩
备注:模拟,BFS水题
感觉这个题没有什么做的价值…前一题做了就够了。
注意几个比较隐晦的细节,每一步必须跳过棋子,且最近的位置必须有棋子,必须跳到最近的空,还有个说法是按字典序最小的输出。
#include<bits/stdc++.h>
using namespace std;
//↖ ↗ ← → ↙ ↘
const int dir[][6]={{},{0,0,0,0,1,2},{0,-1,0,1,2,3},{-2,0,-1,0,2,3},
{0,-2,0,1,3,4},{-3,-2,-1,1,3,4},{-3,0,-1,0,3,4},
{0,-3,0,1,4,5},{-4,-3,-1,1,4,5},{-4,-3,-1,1,4,5},
{-4,0,-1,0,4,5},{0,-4,0,1,0,0},{-5,-4,-1,1,0,0},
{-5,-4,-1,1,0,0},{-5,-4,-1,1,0,0},{-5,0,-1,0,0,0}};
const int maxn=1<<16;
bool vis[maxn];
struct node{
int state,pnum,bef,id,stp,bp,np;
}p[maxn];
void print(int ind){
if(p[ind].bef==-1)return;
print(p[ind].bef);
if(p[p[ind].bef].bef!=-1)printf(" ");
printf("%d %d",p[ind].bp,p[ind].np);
}
int main(void){
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t,x;
for(int i=0;i<maxn;i++)p[i].id=i;
p[0].bef=-1;
p[0].pnum=14;
p[0].stp=0;
scanf("%d",&t);
while (t--){
scanf("%d",&x);
memset(vis,false,sizeof(vis));
p[0].state=((1<<16)-1)^(1<<x);
vis[p[0].state]=true;
queue<node>q;
q.push(p[0]);
int ans=-1,cnt=0;
while(!q.empty()){
node u=q.front(); q.pop();
if(u.pnum==1&&((u.state>>x)&1)){
ans=u.id; break;
}
for(int i=1;i<=15;i++){
if(!((u.state>>i)&1))continue;
for(int j=0;j<6;j++){
if(!dir[i][j])continue;
int pos=i+dir[i][j];
if(!((u.state>>pos)&1))continue;
while(dir[pos][j]&&((u.state>>pos)&1))pos+=dir[pos][j];
if((u.state>>pos)&1)continue;
cnt++;
p[cnt].state=u.state|(1<<pos);
p[cnt].pnum=u.pnum+1;
for(int pos2=i;pos2!=pos;){
if((u.state>>pos2)&1){
p[cnt].state^=(1<<pos2);
p[cnt].pnum--;
}
pos2=pos2+dir[pos2][j];
}
if(vis[p[cnt].state]){
cnt--; continue;
}
vis[p[cnt].state]=true;
p[cnt].bef=u.id;
p[cnt].stp=u.stp+1;
p[cnt].bp=i;
p[cnt].np=pos;
q.push(p[cnt]);
}
}
}
printf("%d\n",p[ans].stp);
print(ans); printf("\n");
}
return 0;
}