[构造 八数码] Codeforces 472E #270 E. Design Tutorial: Learn from a Game

$n=1$或$m=1$的时候特判 不然就是有解的
需要前置技能手玩八数码 然后就可以不断把$n$和$m$缩小
直到$n=2,m=2$
这时候 因为可以斜着走 就可能有解
写起来一点不愉悦

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<vector>
#define pb push_back
using namespace std;
typedef pair<int,int> abcd;

#define read(x) scanf("%d",&(x))

const int N=35;

vector<int> sx[N*N];
int head[N*N];

int n,m;
int a[N][N],_a[N][N];
inline int P(int x,int y) { return (x-1)*m+y; }
inline int X(int x){ return (x-1)/m+1; }
inline int Y(int x){ return (x-1)%m+1; }

int b[N];
inline bool check(int n){
  for (int i=1;i<=n;i++) if (b[i]!=i) return 0; return 1;
}
inline void work(){
  if (n==1){
    for (int i=1;i<=m;i++){
      for (int j=1;j<=m;j++) b[j]=a[1][j];
      for (int j=i;j<=m;swap(b[j],b[j+1]),j++)
    if (check(m)){
      printf("%d\n",j-i);
      for (int k=i;k<=j;k++)
        printf("%d %d\n",1,k);
      return;
    }
      for (int j=1;j<=m;j++) b[j]=a[1][j];
      for (int j=i;j;swap(b[j],b[j-1]),j--)
    if (check(m)){
      printf("%d\n",i-j);
      for (int k=i;k>=j;k--)
        printf("%d %d\n",1,k);
      return;
    }
    }
  }else{
    for (int i=1;i<=n;i++){
      for (int j=1;j<=n;j++) b[j]=a[j][1];
      for (int j=i;j<=n;swap(b[j],b[j+1]),j++)
    if (check(n)){
      printf("%d\n",j-i);
      for (int k=i;k<=j;k++)
        printf("%d %d\n",k,1);
      return;
    }
      for (int j=1;j<=n;j++) b[j]=a[j][1];
      for (int j=i;j;swap(b[j],b[j-1]),j--)
    if (check(n)){
      printf("%d\n",i-j);
      for (int k=i;k>=j;k--)
        printf("%d %d\n",k,1);
      return;
    }
    }
  }
  printf("-1\n");
}

vector<abcd> ans;
#define pt(x,y) (ans.pb(abcd(x,y)))
int nx,ny;
int pos[N*N];

inline void Swap(int x1,int y1,int x2,int y2){
  swap(a[x1][y1],a[x2][y2]); swap(pos[a[x1][y1]],pos[a[x2][y2]]);
}
inline void jump(int x,int y){
  if (x==nx && y==ny) return;
  pt(x,y); Swap(nx,ny,x,y); nx=x; ny=y;
}
inline void jump(int p){
  jump(X(p),Y(p));
}

int fl,fr;
int Q[N*N],l,r;
int pre[N*N];
int vst[N*N];

const int dx[]={0,0,1,-1,1,1,-1,-1};
const int dy[]={1,-1,0,0,1,-1,1,-1};

int ins[N*N];

inline void bfs(int S,int T){
  l=r=-1;
  Q[++r]=S; ins[S]=1;
  int x,y,sx,sy;
  while (l<r){
    ++l; x=X(Q[l]),y=Y(Q[l]);
    for (int k=0;k<8;k++){
      sx=x+dx[k],sy=y+dy[k];
      if (sx<1 || sy<1 || sx>n || sy>m || vst[a[sx][sy]] || ins[P(sx,sy)]) continue;
      Q[++r]=P(sx,sy); ins[P(sx,sy)]=1; pre[P(sx,sy)]=P(x,y);
      if (P(sx,sy)==T) {
    for (int i=0;i<=r;i++) ins[Q[i]]=0;
    return;  
      }
    }
  }
}

int lst[N*N],pnt;

inline void moveto(int x,int y){
  if (nx==x && ny==y) return;
  bfs(P(nx,ny),P(x,y));
  int t=P(x,y); pnt=0; while (t!=P(nx,ny)) lst[++pnt]=t,t=pre[t]; lst[++pnt]=t;
  reverse(lst+1,lst+pnt+1);
  for (int i=2;i<=pnt;i++)
    jump(lst[i]);
}

int path[N*N],tot;

inline void move(int x1,int y1,int x2,int y2){
  vst[a[x1][y1]]=1;
  bfs(P(x1,y1),P(x2,y2));
  int t=P(x2,y2);
  tot=0; while (t!=P(x1,y1)) path[++tot]=t,t=pre[t]; path[++tot]=t;
  reverse(path+1,path+tot+1);
  for (int i=2;i<=tot;i++){
    moveto(X(path[i]),Y(path[i]));
    jump(X(path[i-1]),Y(path[i-1]));
  } 
}

inline void Solve(int n,int m){
  if (n==2 && m==2){
    if (pos[P(2,2)]!=P(2,2))
      jump(2,2),jump(pos[P(2,2)]);
    if (pos[P(2,1)]!=P(2,1))
      jump(2,1),jump(pos[P(2,1)]);
    if (pos[P(1,2)]!=P(1,2))
      jump(1,2),jump(pos[P(1,2)]);
    return;
  }
  if (n>=m){
    int t;
    for (int i=1;i<=m-2;i++){
      if ((t=pos[P(n,i)])!=P(n,i))
    move(X(t),Y(t),n,i);
      vst[P(n,i)]=1;
    }
    if ((t=pos[P(n,m-1)])!=P(n,m))
      move(X(t),Y(t),n,m);
    vst[P(n,m-1)]=1;
    if ((t=pos[P(n,m)])!=P(n-1,m))
      move(X(t),Y(t),n-1,m);
    vst[P(n,m)]=1;
    moveto(n,m-1);
    jump(n,m);
    jump(n-1,m);
    Solve(n-1,m);
  }else{
    int t;
    for (int i=1;i<=n-2;i++){
      if ((t=pos[P(i,m)])!=P(i,m))
    move(X(t),Y(t),i,m);
      vst[P(i,m)]=1;
    }
    if ((t=pos[P(n-1,m)])!=P(n,m))
      move(X(t),Y(t),n,m);
    vst[P(n-1,m)]=1;
    if ((t=pos[P(n,m)])!=P(n,m-1))
      move(X(t),Y(t),n,m-1);
    vst[P(n,m)]=1;
    moveto(n-1,m);
    jump(n,m);
    jump(n,m-1);
    Solve(n,m-1);
  }
}

int main(){
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  read(n); read(m);
  for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) read(a[i][j]);
  for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) read(_a[i][j]),sx[_a[i][j]].pb(P(i,j));
  for (int i=1;i<=n;i++)
    for (int j=1;j<=m;j++){
      head[a[i][j]]++;
      if (head[a[i][j]]>(int)sx[a[i][j]].size()) return printf("-1\n"),0;
      a[i][j]=sx[a[i][j]][head[a[i][j]]-1];     
    }
  if (n==1 || m==1) { work(); return 0; }
  for (int i=1;i<=n;i++)
    for (int j=1;j<=m;j++){
      if (a[i][j]==1) pt(i,j),nx=i,ny=j;
      pos[a[i][j]]=P(i,j);
    }
  Solve(n,m);
  printf("%d\n",ans.size()-1);
  for (int i=0;i<(int)ans.size();i++)
    printf("%d %d\n",ans[i].first,ans[i].second);
  return 0;
}