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 <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <climits>
#include <algorithm>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <queue>
#include <bitset>
#include <string>
using namespace std;
 
#define rep(i,n) for(int i=0; i<n; i++)
#define repa(i,s,e) for(int i=s; i<=e; i++)
#define repd(i,s,e) for(int i=s; i>=e; i--)
#define PB(a) push_back(a)
#define MP(i,s) make_pair(i,s)
 
typedef long long ll;

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

const int ans[5][5] = {
	{0, 0, 0, 0, 0},
	{0, 1, 2, 3, 0},
	{4, 5, 6, 7, 8},
	{0, 9, 10, 11, 0},
	{0, 0, 0, 0, 0}
};

const int px[13] = {2, 1, 2, 3, 0, 1, 2, 3, 4, 1, 2, 3, 2};
const int py[13] = {0, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 4};

int P[5][5];
map<ll,int> used;
map<ll,int> H;

ll hash_val() {
	ll h = 0;
	rep(i,13) {
		h *= 13;
		h += P[py[i]][px[i]];
	}
	return h;
}

void make_ans(int m, int d) {
	ll h = hash_val();
	if(m == d) return;
	map<ll,int>::iterator it = H.find(h);
	
	if(it == H.end()) {
		H.insert(MP(h,m));
	} else if((*it).second > m) {
		(*it).second = m;
	} else {
		return;
	}

	H.insert(MP(h,m));
	rep(i,13) {
		int x = px[i];
		int y = py[i];
		if(P[y][x] == 0) {
			rep(k,4) {
				int xx = x + dx[k];
				int yy = y + dy[k];
				if(xx>=0 && yy>=0 && xx<5 && yy<5 && field[yy][xx] == 1 && P[yy][xx] != 0) {
					swap(P[y][x], P[yy][xx]);
					make_ans(m+1, d);
					swap(P[y][x], P[yy][xx]);
				}
			}
		}
	}
}

int dfs(int m, int d) {
	map<ll,int>::iterator it;
	ll h = hash_val();

	it = H.find(h);
	if(it != H.end()) return m + (*it).second;

	if(m == d) return -1;
	
	it = used.find(h);
	if(it == used.end()) {
		used.insert(MP(h,m));
	} else if((*it).second > m) {
		(*it).second = m;
	} else {
		return -1;
	}

	rep(i,13) {
		int x = px[i];
		int y = py[i];
		if(P[y][x] == 0) {
			rep(k,4) {
				int xx = x + dx[k];
				int yy = y + dy[k];
				if(xx>=0 && yy>=0 && xx<5 && yy<5 && field[yy][xx] == 1 && P[yy][xx] != 0) {
					swap(P[y][x], P[yy][xx]);
					int a = dfs(m+1, d);
					if(a >= 0) return a;
					swap(P[y][x], P[yy][xx]);
				}
			}
		}
	}
	return -1;
}

void solve() {
	repa(d,0,10) {
		used.clear();
		int a = dfs(0, d);
		if(a >= 0 && a <= 20) {
			printf("%d\n", a);
			return;
		}
	}
	printf("NA\n");
}

int main() {
	memcpy(P, ans, sizeof(P));
	make_ans(0, 10);
	for(;;) {
		rep(i,13) {
			scanf("%d", &P[py[i]][px[i]]);
			if(P[py[i]][px[i]] < 0) return 0;
		}
		solve();
	}
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)
class NODE{
public:
	vector<int> data;
	int depth;
	int e[2];
	NODE(int a[13],int d,int E[2]){
		data.resize(13);
		rep(i,13)data[i] = a[i];
		depth = d;
		rep(i,2)e[i] = E[i];
	}
	NODE(){
		depth = 0;
		data.resize(13);
	}
};

int di[13][10] = {
	{2,-1},
	{2,5,-1},
	{0,1,3,6,-1},
	{2,7,-1},
	{5,-1},
	{1,4,6,9,-1},
	{2,5,7,10,-1},
	{3,6,7,11,-1},
	{7},
	{5,10,-1},
	{6,9,11,12,-1},
	{7,10,-1},
	{10,-1}
};

int main(){
	while(1){
		int ret = 21;
		NODE fst; int cnt = 0;
		rep(i,13){
			if(cin >>fst.data[i] , fst.data[i] != -1){
				if(fst.data[i] == 0){
					fst.e[cnt] = i;
					cnt++;
				}
			}else{
				return 0;
			}
		}
		map< vector<int> , int > done[2];
		
		rep(x,2){
			queue<NODE> Q;
			if(x==0){
				Q.push(fst);
			}else{
				NODE a;
				rep(i,11)a.data[i+1] = i+1;
				a.e[0] = 0;
				a.e[1] = 12;
				Q.push(a);
			}
			done[x][Q.front().data] = 0;
			while(Q.size()){
				NODE q = Q.front(); Q.pop();
				if(x == 1){
					if( done[0].find(q.data) != done[0].end() ){
						ret = q.depth + done[0][q.data] ;
						break;
					}
				}else{
					if( q.data[0] == 0 && q.data[1] == 1 && q.data[2] == 2 && q.data[3] == 3 && q.data[4] == 4 && q.data[5] == 5 && q.data[6] == 6 && q.data[7] == 7 &&
							q.data[8] == 8 && q.data[9] == 9 && q.data[10]==10 && q.data[11]==11 && q.data[12]==0
					){
						ret = q.depth;
						break;
					}
				}
				if(q.depth >= 10)continue;

				rep(o,2){
					for(int i=0;di[q.e[o]][i] != -1;i++){
						NODE next = q;
						next.e[o] = next.data[di[q.e[o]][i]];
						swap(next.data[q.e[o]] , next.data[di[q.e[o]][i]]);
						next.depth = q.depth + 1;
						
						if( done[x].find(next.data) == done[x].end() ){
							done[x][next.data] = next.depth;
							Q.push(next);
						}
					}
				}
			}
		}
		if(ret > 20){
			cout << "NA" << endl;
		}else{
			cout << ret << endl;
		}
	}
}