Go: // BFS

package main

import (
	"bufio"
	"os"
		"fmt"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

var p = [15]int{}
var g = [13][4]int {
	// -1は存在しないマス目
	{2,-1,-1,-1},
	{2,5,-1,-1},{0,1,3,6},{2,7,-1,-1},
	{5,-1,-1,-1},{1,4,6,9},{2,5,7,10},{3,6,8,11},{7,-1,-1,-1},
	{5,10,-1,-1},{6,9,11,12},{7,10,-1,-1},
	{10,-1,-1,-1},
}

/*
　  ０ １ ２ ３ ４
 0 |／|／|  |／|／|
 1 |／|　|  |　|／|
 2 |　|　|  |　|　|
 3 |／|　|  |　|／|
 4 |／|／|  |／|／|
*/

var row = [13]int{0,1,1,1,2,2,2,2,2,3,3,3,4}
var col = [13]int{2,1,2,3,0,1,2,3,4,1,2,3,2}

type wolf struct {
	m [13]int
}

type pair struct {
	first wolf
	second int
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func print_board(board [13]int) {
	fmt.Println("--------------------------")
	fmt.Printf("        [%2d]\n", board[0])
	fmt.Printf("    [%2d][%2d][%2d]\n", board[1], board[2], board[3])
	fmt.Printf("[%2d][%2d][%2d][%2d][%2d]\n", board[4], board[5], board[6], board[7], board[8])
	fmt.Printf("    [%2d][%2d][%2d]\n", board[9], board[10], board[11])
	fmt.Printf("        [%2d]\n", board[12])
	fmt.Println("--------------------------")
}

func main() {
	for scanner.Scan() {
		p1, _ := strconv.Atoi(scanner.Text())
		if p1 == -1 {
			break
		}
		p[0]= p1
		scanner.Scan()
		buf1 := strings.Split(scanner.Text(), " ")
		p2, _ := strconv.Atoi(buf1[0])
		p3, _ := strconv.Atoi(buf1[1])
		p4, _ := strconv.Atoi(buf1[2])
		p[1], p[2], p[3] = p2, p3, p4
		scanner.Scan()
		buf2 := strings.Split(scanner.Text(), " ")
		p5, _ := strconv.Atoi(buf2[0])
		p6, _ := strconv.Atoi(buf2[1])
		p7, _ := strconv.Atoi(buf2[2])
		p8, _ := strconv.Atoi(buf2[3])
		p9, _ := strconv.Atoi(buf2[4])
		p[4], p[5], p[6], p[7], p[8] = p5, p6, p7, p8, p9
		scanner.Scan()
		buf3 := strings.Split(scanner.Text(), " ")
		p10, _ := strconv.Atoi(buf3[0])
		p11, _ := strconv.Atoi(buf3[1])
		p12, _ := strconv.Atoi(buf3[2])
		p[9], p[10], p[11] = p10, p11, p12
		scanner.Scan()
		p13, _ := strconv.Atoi(scanner.Text())
		p[12] = p13
		S := make(map[wolf]struct{})
		st := wolf{}
		for i := 0; i < 13; i++ {
			st.m[i] = p[i]
		}
		Q := make([]pair, 0)
		S[st] = struct{}{}
		Q = append(Q, pair{st, 0})
		yet := true
		for len(Q) > 0 {
			at := Q[0].first
			print_board(at.m)
			cost := Q[0].second
			Q = Q[1:]
			ok := true
			for i :=1; i < 12; i++ {
				if at.m[i] != i {
					ok = false
				}
			}
			if ok {
				// print_board(at.m)
				yet = false
				fmt.Println(cost)
				break
			}
			now := cost
			for i := 0; i < 13; i++ {
				if at.m[i] != 0 {
					now += abs(row[i]-row[at.m[i]]) + abs(col[i]-col[at.m[i]])
				}
			}
			if now > 20 {
				continue
			}
			for i := 0; i < 13; i++ {
				if at.m[i] == 0 {
					for j := 0; j < 4; j++ {
						if ^g[i][j] != 0 {
							at.m[i], at.m[g[i][j]] = at.m[g[i][j]], at.m[i]
							if _, ok := S[at]; !ok {
								S[at] = struct{}{}
								Q = append(Q, pair{at, cost+1})
							}
							at.m[i], at.m[g[i][j]] = at.m[g[i][j]], at.m[i]
						}
					}
				}
			}
		}
		if yet {
			fmt.Println("NA")
		}
	}
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<unordered_map>
#define lol(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
typedef long long ll;
using namespace std;
int dx[13][4]={
  {3,0,0,0},
  {3,6,0,0},
  {1,2,4,6},
  {3,8,0,0},
  {6,0,0,0},
  {2,5,7,10},
  {3,6,8,11},
  {4,7,9,12},
  {8,0,0,0},
  {6,11,0,0},
  {6,10,12,13},
  {8,11,0,0},
  {11,0,0,0}
};
unordered_map<ll,int> mp;
ll Compress(int p[]){
  ll ans=0;
  for(int i=0;i<13;i++){
    ans*=13;
    ans+=p[i];
  }
  return ans;
}

int unzip[13];
void Unzip(ll x){
  for(int i=0;i<13;i++){
    unzip[12-i]=x%13;
    x/=13;
  }
}

int beflen=0;
queue<pair<ll,int> >Q;
void BFS(int p[],int len){
  //if(len!=beflen){cout<<len<<endl;beflen=len;}
  ll tmp=Compress(p);
  mp[tmp]=len;
  if(len==15)return;
  lol(i,13){
    if(p[i]==0){
      lol(j,4){
	int t=dx[i][j];
	if(t==0)break;
	t--;
	if(p[t]!=0){
	  swap(p[i],p[t]);
	  tmp=Compress(p);
	  if(mp[tmp]!=0)continue;
	  mp[tmp]=-1;
	  Q.push(make_pair(tmp,len+1));
	  swap(p[i],p[t]);
	}
      }
    }
  }
}

int ans;
void EFS(int p[],int len){
  //if(len!=beflen){cout<<len<<endl;beflen=len;}
  ll tmp=Compress(p);
  if(mp[tmp]>0){
    ans=min(ans,len+mp[tmp]);
    return;
  }
  if(len==7)return;
  lol(i,13){
    if(p[i]==0){
      lol(j,4){
	int t=dx[i][j];
	if(t==0)break;
	t--;
	if(p[t]!=0){
	  swap(p[i],p[t]);
	  tmp=Compress(p);
	  Q.push(make_pair(tmp,len+1));
	  swap(p[i],p[t]);
	}
      }
    }
  }
}
int main(){
  int p[13];
  lol(i,13)p[i]=i;p[12]=0;
  Q.push(make_pair(Compress(p),1));
  while(!Q.empty()){
    ll data=Q.front().first;
    int len=Q.front().second;
    Q.pop();
    if(mp[data]>0)continue;
    Unzip(data);
    BFS(unzip,len);
  }
  while(cin>>p[0]&&p[0]!=-1){
    for(int i=1;i<13;i++)cin>>p[i];
    ans=mod;
    Q.push(make_pair(Compress(p),0));
    while(!Q.empty()){
      ll data=Q.front().first;
      int len=Q.front().second;
      Q.pop();
      Unzip(data);
      EFS(unzip,len);
    }
    if(ans==mod)cout<<"NA"<<endl;
    else cout<<ans-1<<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <vector>
 
using namespace std;
 
struct P {
    int y, x;
    P(int y, int x) : y{y}, x{x} {}
};
 
int limit;
vector<int> v;
 
P getPos(int x)
{
    if (x == 0) return P(0, 2);
    if (1 <= x && x <= 3) return P(1, x);
    if (4 <= x && x <= 8) return P(2, x - 4);
    if (9 <= x && x <= 11) return P(3, x - 8);
    return P(4, 2);
}
 
int getPos(P p)
{
    switch (p.y) {
        case 0:
            return (p.x == 2 ? 0 : -1);
        case 1:
            return (1 <= p.x && p.x <= 3 ? p.x : -1);
        case 2:
            return (0 <= p.x && p.x <= 4 ? p.x + 4 : -1); 
        case 3:
            return (1 <= p.x && p.x <= 3 ? p.x + 8 : -1);
        case 4:
            return (p.x == 2 ? 12 : -1);
    }
    return -1;
}
 
int getMD()
{
    int sum = 0;
    for (int i = 0; i < 13; i++) {
        if (v[i] == 0) continue;
        P np = getPos(i);
        P tp = getPos(v[i]);
        sum += abs(np.x - tp.x) + abs(np.y - tp.y);
    }
    return sum;
}
 
constexpr int dx[] = {-1, 0, 1, 0};
constexpr int dy[] = {0, -1, 0, 1};
 
bool dfs(int sp1, int sp2, int step)
{
    int md = getMD();
    if (md == 0) return 1;
    if (md + step > limit) {
        return 0;
    }
    P p[2] = {getPos(sp1), getPos(sp2)};
    for (int i = 0; i < 2; i++) {
        int x = p[i].x, y = p[i].y;
        for (int j = 0; j < 4; j++) {
            int nx = x + dx[j], ny = y + dy[j];
            P np(ny, nx);
            int next = getPos(np);
            if (next == -1) continue;
            if (i == 0) {
                swap(v[sp1], v[next]);
                if (dfs(next, sp2, step + 1)) {
                    return 1;
                }
                swap(v[sp1], v[next]);
            } else {
                swap(v[sp2], v[next]);
                if (dfs(sp1, next, step + 1)) {
                    return 1;
                }
                swap(v[sp2], v[next]);
            }
        }
    }
    return 0;
}
 
int main()
{
    int x;
    while (cin >> x, x != -1) {
        int sp[2];
        v.resize(13); v[0] = x;
        for (int i = 1; i < 13; i++) {
            cin >> v[i];
        }
        for (int i = 0, j = 0; i < 13; i++) {
            if (v[i] == 0) {
                sp[j++] = i;
            }
        }
        bool found = 0;
        constexpr int LIMIT = 20;
        for (limit = 0; limit <= LIMIT; limit++) {
            if (dfs(sp[0], sp[1], 0)) {
                cout << limit << endl;
                found = 1;
                break;
            }
        }
        if (!found) {
            cout << "NA" << endl;
        }
    }
    return 0;
}