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 "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;

//// < "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D_Download\Visual Studio 2015\Projects\programing_contest_c++\Debug\b.answer"

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

#include<unordered_map>
class HashVI {  // ???????????\??¢??°???????????§??????
public:
	size_t operator()(const vector<int> &x) const {
		const int C = 997;      // ?´???°
		size_t t = 0;
		for (int i = 0; i != x.size(); ++i) {
			t = t * C + x[i];
		}
		return t;
	}
	size_t operator()(const vector<vector<int>> &x) const {
		const int C = 997;      // ?´???°
		size_t t = 0;
		for (int i = 0; i != x.size(); ++i) {
			for (int j = 0; j < x[i].size(); ++j) {
				t = t * C + x[i][j];
			}
		}
		return t;
	}
};
int dx[] = { -1,0,1,0 };
int dy[] = { 0,1,0,-1 };
int aaa=21;
void solve(vector<vector<int>>&start,const int turn ) {
	if (aaa <= turn)return;
	if (start == ans) {
		aaa = min(aaa, turn);
	}
	else {
		for (int i = 1; i < 6; ++i) {
			for (int j = 1; j < 6; ++j) {
				if (start[i][j] == 0) {
					for (int way = 0; way < 4; ++way) {
						if (start[i + dy[way]][j + dx[way]]>0) {
							swap(start[i][j],start[i + dy[way]][j + dx[way]]);
							if (start == ans) {
								aaa = min(aaa, turn);
							}
							else {

								solve(start, turn+1);
							}
							swap(start[i][j], start[i + dy[way]][j + dx[way]]);
						}
					}
				}
			}
		}
	}
	
}

int main() {
	while (1) {
		int a; cin >> a;
		aaa = 21;
		if (a == -1)break;
		vector<vector<int>>puzzle(7, vector<int>(7,-1));
		puzzle[1][3] = a;
		for (int i = 2; i <= 5; ++i) {
			for (int j = 3 - (2-(abs(i - 3))); j <= 3 + (2-abs(i - 3)); ++j) {
				cin >> puzzle[i][j];
			}
		}
		if (puzzle == ans) {
			cout << 0 << endl;
		}
		else {

			solve(puzzle, 1);
			if (aaa == 21)cout << "NA" << endl;
			else cout << aaa << endl;
		}
	}
	return 0;
}

C++: #include<bits/stdc++.h>
using namespace std;
   
typedef long long int64;
const int INF = 1 << 30;
   
vector< int > edge[13];
  
bool back(string str, int cnt){ //枝刈り大事だな
  static int dist[] = { 0, 2, 1, 2, 4, 3, 2, 3, 4, 2, 1, 2, 0};
  static int fuee[] = { 2, 0, 1, 2, 2, 1, 2, 3, 4, 2, 3, 4, 4};
  static int fuga[] = { 1, 1, 0, 1, 3, 2, 1, 2, 3, 3, 2, 3, 3};
  static int haaa[] = { 2, 2, 1, 0, 4, 3, 2, 1, 2, 4, 3, 2, 4};
  static int kira[] = { 3, 3, 2, 3, 3, 2, 1, 2, 3, 1, 0, 1, 1};
  
  if(cnt > 20) return true;
  int foo1 = 0, foo2 = 0, foo3 = 0, foo4 = 0, foo5 = 0;
  for(int i = 0; i < 13; i++){
    if(str[i] == '1') foo2 += fuee[i];
    else if(str[i] == '2') foo3 += fuga[i];
    else if(str[i] == '3') foo4 += haaa[i];
    else if(str[i] == 'A') foo5 += kira[i];
  }
  return cnt + foo2 + foo3 + foo4 + foo5 > 20;
}
  
  
int bfs(string mas){
  
  queue< string > que;
  map< string , int > memo;
  que.push( mas );
  memo[mas] = 0;
  while(!que.empty()){
  
    string p = que.front(); que.pop();
    if(back( p, memo[p])) continue;
    if(p == "0123456789AB0") return memo[p];
  
    for(int i = 0; i < 13; i++){
      if(p[i] == '0') {
        for(int j = 0; j < edge[i].size(); j++){
          string next = p;
          swap( next[i], next[edge[i][j]]);
          if(memo.find(next) != memo.end()) continue;
          que.push( next );
          memo[next] = memo[p] + 1;
        }
      }
    }
  }
  return -1;
}
  
int main(){
  vector< int > mas(13);
  
  edge[0].push_back(2);
  edge[1].push_back(2); edge[1].push_back(5);
  edge[2].push_back(0); edge[2].push_back(1); edge[2].push_back(3); edge[2].push_back(6);
  edge[3].push_back(2); edge[3].push_back(7);
  edge[4].push_back(5);
  edge[5].push_back(1); edge[5].push_back(4); edge[5].push_back(6); edge[5].push_back(9);
  edge[6].push_back(2); edge[6].push_back(5); edge[6].push_back(7); edge[6].push_back(10);
  edge[7].push_back(3); edge[7].push_back(6); edge[7].push_back(8); edge[7].push_back(11);
  edge[8].push_back(7);
  edge[9].push_back(5); edge[9].push_back(10);
  edge[10].push_back(6); edge[10].push_back(9); edge[10].push_back(11); edge[10].push_back(12);
  edge[11].push_back(7); edge[11].push_back(10);
  edge[12].push_back(10);
  
  while(cin >> mas[0], mas[0] != -1){
    for(int i = 1; i < 13; i++){
      cin >> mas[i];
    }
  
    string start = "";
    for(int i = 0; i < 13; i++){
      if(mas[i] >= 10) start += (char)(mas[i] - 10 + 'A');
      else start += mas[i] + '0';
    }
    int ret = bfs(start);
    if(~ret) cout << ret << endl;
    else cout << "NA" << endl;
  }
}