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 <string>
#include <vector>
#include <queue>
#include <map>
using namespace std;

string s = "0123456789AB";
string goal = "0123456789AB0";

vector<vector<int>> adj = {
    {2},
    {2,5},
    {0,1,3,6},
    {2,7},
    {5},
    {1,4,6,9},
    {2,5,7,10},
    {3,6,8,11},
    {7},
    {5,10},
    {6,9,11,12},
    {7,10},
    {10}
};

int solve(string stat) {
    map<string, int> dist;
    dist[stat] = 0;
    queue<string> q;
    q.push(stat);
    while ( ! q.empty()) {
        string s = q.front();
        q.pop();
        int diff = 0;
        for (int k=0; k<13; ++k) {
            if (s[k] != '0') {
                diff += s[k] != goal[k];
            }
        }
        if ( ! diff) {
            return dist[s];
        }
        if (20 < dist[s] + diff) {
            continue;
        }
        for (int i=0; i<13; ++i) {
            if (s[i] != '0') continue;
            for (int j : adj[i]) {
                string next = s;
                next[i] = s[j];
                next[j] = s[i];
                if (dist.find(next) == dist.end()) {
                    dist[next] = dist[s] + 1;
                    q.push(next);
                }
            }
        }
    }
    return 21;
}

int main() {
    ios::sync_with_stdio(false);
    while (1) {
        string stat = "";
        int k;
        for (int i=0; i<13; ++i) {
            if (cin >> k && !~k) return 0;
            stat += s[k];
        }
        int ans = solve(stat);
        if (ans <= 20) {
            cout << ans << endl;
            continue;
        }
        cout << "NA" << endl;
    }
    return 0;
}

C++: #include<cstdio>
#include<algorithm>
#include<iostream>
#include<queue>
#include<functional>
#include<map>
#include<vector>
using namespace std;
class P{
    public:
    int state[13];
    int cnt;
    int p1;
    int p2;
    P(){}
    P(int a[13],int cnt,int p1,int p2):cnt(cnt),p1(p1),p2(p2){
        for(int i = 0; i < 13; i++){
            state[i] = a[i];
        }
    }
};
int rules[13][6]={
    {1,2},{2,2,5},{4,0,1,3,6},{2,2,7},{1,5},
    {4,1,4,6,9},{4,2,5,7,10},{4,3,6,8,11},{1,7},{2,5,10},
    {4,6,9,11,12},{2,7,10},{1,10}
};
 
map< string , int >memo;
 
string getIndex(int *a){
    string tmp="";
    for(int i = 0; i < 13; i++){
        tmp += (a[i]+48);
    }
    return tmp;
}
 
void bfs(){
    int F[] = {0,1,2,3,4,5,6,7,8,9,10,11,0};
    queue < P > Q;
    Q.push(P(F,1,0,12));
    while( true ){
        if(Q.size() == 0)break;
        P p = Q.front();Q.pop();
        if(p.cnt > 21)break;
        string index = getIndex(p.state);
        if( memo[index] )continue;
        memo[index] = p.cnt;
        for(int j = 0; j < rules[p.p1][0]; j++){
            if(p.state[rules[p.p1][j+1]] == 0)continue;
            swap(p.state[p.p1],p.state[rules[p.p1][j+1]]);
            Q.push(P(p.state,p.cnt+1,p.state[p.p1],p.p2));
            swap(p.state[p.p1],p.state[rules[p.p1][j+1]]);
        }
        for(int j = 0; j < rules[p.p2][0]; j++){
            if(p.state[rules[p.p2][j+1]] == 0)continue;
            swap(p.state[p.p2],p.state[rules[p.p2][j+1]]);
            Q.push(P(p.state,p.cnt+1,p.p1,p.state[p.p2]));
            swap(p.state[p.p2],p.state[rules[p.p2][j+1]]);
        }
    }
    return ;
}
int main(){
    bfs();
    int input[13];
    while(true){
        scanf("%d",&input[0]);
        if(input[0] == -1)break;
        for(int i = 1; i < 13; i++){
            scanf("%d",&input[i]);
        }
        string index = getIndex(input);
        if( memo[index] )printf("%d\n",memo[index]-1);
        else puts("NA");
    }
    return 0;
}