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>
#define int long long
#define r(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef pair<int,int>P;
vector<int>v[13],s(13),t(13);
map<int,int>m;

int has[14];


void init(){

    v[0].push_back(2);

    v[1].push_back(2);
    v[1].push_back(5);

    v[2].push_back(0);
    v[2].push_back(1);
    v[2].push_back(3);
    v[2].push_back(6);

    v[3].push_back(2);
    v[3].push_back(7);

    v[4].push_back(5);

    v[5].push_back(1);
    v[5].push_back(4);
    v[5].push_back(6);
    v[5].push_back(9);

    v[6].push_back(2);
    v[6].push_back(5);
    v[6].push_back(7);
    v[6].push_back(10);

    v[7].push_back(3);
    v[7].push_back(6);
    v[7].push_back(8);
    v[7].push_back(11);

    v[8].push_back(7);

    v[9].push_back(5);
    v[9].push_back(10);

    v[10].push_back(6);
    v[10].push_back(9);
    v[10].push_back(11);
    v[10].push_back(12);

    v[11].push_back(7);
    v[11].push_back(10);

    v[12].push_back(10);

    int a=20;
    int p=1;

    r(i,13){
        has[i]=p;
        p*=a;
    }
}

int ha(vector<int> &x){

    int re=0;

    r(i,13){
        re+=x[i]*has[i];
    }

    return re;
}

vector<int> ah(int x){
    vector<int>y(13);
    r(i,13){
        y[i]=x%20;
        x/=20;
    }
    return y;
}

void BFS1(){
    s[0]=0;
    s[12]=0;
    r(i,11)s[i+1]=i+1;
    set<int>st;
    st.insert(ha(s));
    m[ha(s)]=0;
    queue<P>q;
    q.push(P(ha(s),0));
    while(1){
        vector<int> now=ah(q.front().first);
        int cost=q.front().second;
        q.pop();
        if(cost==7)break;
        r(i,13)if(now[i]!=0){
            r(j,v[i].size()){
                swap(now[i],now[v[i][j]]);
                if(!st.count(ha(now))){
                    st.insert(ha(now));
                    m[ha(now)]=cost+1;
                    q.push(P(ha(now),cost+1));
                }
                swap(now[i],now[v[i][j]]);
            }
        }
    }
}

void BFS2(){
    set<int>st;
    st.insert(ha(t));
    queue<P>q;
    q.push(P(ha(t),0));
    while(1){
        vector<int>now=ah(q.front().first);
        int cost=q.front().second;
        if(m.count(ha(now))){
            cout<<m[ha(now)]+cost<<endl;
            return ;
        }
        q.pop();
        if(cost==5)break;
        r(i,13)if(now[i]!=0){
            r(j,v[i].size()){
                swap(now[i],now[v[i][j]]);
                if(!st.count(ha(now))){
                    st.insert(ha(now));
                    q.push(P(ha(now),cost+1));
                }
                swap(now[i],now[v[i][j]]);
            }
        }
    }
    cout<<"NA"<<endl;
}


signed main(){
    init();
    BFS1();
    while(cin>>t[0],t[0]!=-1){
        r(i,12)cin>>t[i+1];
        BFS2();
    }
}

C++: #include<iostream>
#include<string>
#include<set>
#include<utility>
#include<queue>
#include<algorithm>
using namespace std;

const int N=7;

int f(string first)
{
	const string last(
		"......."
		"...0..."
		"..123.."
		".45678."
		"..9AB.."
		"...0..."
		".......");
	set<string>s;
	queue<string>q;
	string p,next;
	int ans = 0,i,j,k,zeroPos[2],a[]={-1,1,N,-N};

	q.push(first);
	q.push("");
	while(!q.empty())
	{
		p = q.front(); q.pop();
		if(p.empty())
		{
			++ans;
			if(ans > 20)
				return -1;		//èª©©è·¬Ä¢Ü·
			q.push("");
		}
		else if(p==last) break;
		else
		{
			if(!s.insert(p).second)
				continue;	//à¤»Ì`ÉÈÁ½±Æª éÈç½àµÈ¢
			//0ÌêðT·
			zeroPos[0]=p.find('0');
			zeroPos[1]=p.find('0',zeroPos[0]+1);
			//0Ìê©çAãº¶Eª.Å³¯êÎð·µÄo^
			for(i=0;i<2;++i)
			{
				for(j=0;j<4;++j)
				{
					if(p[ zeroPos[i]+a[j] ]!='.')
					{
						next=p;
						swap(next[zeroPos[i]], next[ zeroPos[i]+a[j] ]);
						q.push(next);
					}
				}
			}
		}
	}
	return ans;
}

int main()
{
	const char a[]="0123456789AB";
	//(5+2)^2ÌvfðAÔºà©ËÄmÛ
	string s(49,'.');
	int i,x;
	while(cin>>x,x>=0)
	{
		s[10]=a[x];
		for(i=0;i<3;++i) cin>>x,s[16+i]=a[x];
		for(i=0;i<5;++i) cin>>x,s[22+i]=a[x];
		for(i=0;i<3;++i) cin>>x,s[30+i]=a[x];
		cin>>x,s[38]=a[x];

		x=f(s);
		if(x>=0) cout<<x<<endl;
		else cout<<"NA\n";
	}
	return 0;
}