Problem:
Problem F: Gap

Let’s play a card game called Gap.

You have 28 cards labeled with two-digit numbers. The first digit (from 1 to 4) represents the
suit of the card, and the second digit (from 1 to 7) represents the value of the card.

First, you shuffle the cards and lay them face up on the table in four rows of seven cards, leaving
a space of one card at the extreme left of each row. The following shows an example of initial
layout.

Next, you remove all cards of value 1, and put them in the open space at the left end of the
rows: “11” to the top row, “21” to the next, and so on.

Now you have 28 cards and four spaces, called gaps, in four rows and eight columns. You start
moving cards from this layout.

At each move, you choose one of the four gaps and fill it with the successor of the left neighbor
of the gap. The successor of a card is the next card in the same suit, when it exists. For instance
the successor of “42” is “43”, and “27” has no successor.

In the above layout, you can move “43” to the gap at the right of “42”, or “36” to the gap at
the right of “35”. If you move “43”, a new gap is generated to the right of “16”. You cannot
move any card to the right of a card of value 7, nor to the right of a gap.

The goal of the game is, by choosing clever moves, to make four ascending sequences of the same
suit, as follows.

Your task is to find the minimum number of moves to reach the goal layout.

Input

The input starts with a line containing the number of initial layouts that follow.

Each layout consists of five lines - a blank line and four lines which represent initial layouts of
four rows. Each row has seven two-digit numbers which correspond to the cards.

Output

For each initial layout, produce a line with the minimum number of moves to reach the goal
layout. Note that this number should not include the initial four moves of the cards of value 1.
If there is no move sequence from the initial layout to the goal layout, produce “-1”.

Sample Input

4

12 13 14 15 16 17 21
22 23 24 25 26 27 31
32 33 34 35 36 37 41
42 43 44 45 46 47 11

26 31 13 44 21 24 42
17 45 23 25 41 36 11
46 34 14 12 37 32 47
16 43 27 35 22 33 15

17 12 16 13 15 14 11
27 22 26 23 25 24 21
37 32 36 33 35 34 31
47 42 46 43 45 44 41

27 14 22 35 32 46 33
13 17 36 24 44 21 15
43 16 45 47 23 11 26
25 37 41 34 42 12 31

Output for the Sample Input

0
33
60
-1

Solution in JAVA (judge verdict: Accepted)


import java.util.*;
import java.awt.geom.*;
public class Main {
	//1500 start
	//1732 sample match AC
	
	class C{
		Integer [][] data;
		int step,ind;
		int [] gapx, gapy;
		public C(Integer[][] data, int step, int[] gapx, int[]gapy,int ind) {
			this.data = data;
			this.step = step;
			this.gapx = gapx;
			this.gapy = gapy;
			this.ind = ind;
		}
	}
	
	private void doit(){
		Scanner sc = new Scanner(System.in);
		int dataset = sc.nextInt();
		while(dataset-- > 0){
			Integer [][] data = new Integer[4][8];
			for(int i = 0 ; i < 4; i++){
				data[i][0] = -1;
				for(int j = 1 ; j< 8; j++){
					data[i][j] = sc.nextInt();
				}
			}
			int [] gapx = new int[4], gapy = new int[4];
			int gapind = 0;
			for(int i = 0 ; i < 4; i++){
				for(int j = 1; j < 8; j++){
					if(data[i][j] % 10 == 1){
						int ind = data[i][j] / 10 - 1;
						swap(data, ind, 0, i, j);
						gapx[gapind] = j; gapy[gapind] = i;
						gapind++;
					}
				}
			}
			//check
			boolean res = check(data);
			if(res){
				System.out.println(0);
			}
			else{
				System.out.println(solve(data, gapx, gapy));
			}
		}
	}

	private int solve(Integer [][] d, int [] gapx_, int [] gapy_) {
		LinkedList<C> open = new LinkedList<C>();
		open.add(new C(d, 0, gapx_, gapy_, -1));
		HashMap<String, Integer> close = new HashMap<String, Integer>();
		close.put(tostr(d), 0);
		
		int ans = -1;
		while(! open.isEmpty()){
			C now = open.removeFirst();
			if(check(now.data)){
				ans = now.step;
				break;
			}
			for(int i = 0; i < 4; i++){
				int x =now.gapx[i];
				int y = now.gapy[i];
				if(now.data[y][x-1] == -1 || now.data[y][x-1] % 10 == 7) continue;
				//if(now.ind == i) continue;
				
				int [] res = find(now.data[y][x-1] + 1, now.data);
				if(res[0] == -1)  continue;
				
				Integer [][] next = deepcopy(now.data);
				swap(next, y, x, res[0], res[1]);
				String s = tostr(next);
				if(close.containsKey(s) && close.get(s) <= now.step + 1){
					continue;
				}

				int [] nextx = Arrays.copyOf(now.gapx, 4);
				int [] nexty = Arrays.copyOf(now.gapy, 4);
				nextx[i] = res[1];
				nexty[i] = res[0];
				open.add(new C(next, now.step + 1, nextx, nexty, i));
				close.put(s, now.step + 1);
			}
		}
		return ans;
	}

	private String tostr(Integer[][] d) {
		StringBuilder sb = new StringBuilder();
		for(int  i = 0; i < 4; i++){
			for(int j = 0; j < 8; j++){
				sb.append(d[i][j] + " ");
			}
		}
		return sb.toString();
	}

	private Integer[][] deepcopy(Integer[][] data) {
		Integer [][] data2 = new Integer[4][8];
		for(int i = 0 ; i < 4; i++){
			for(int j = 0 ; j < 8; j++){
					data2[i][j] = data[i][j];
			}
		}
		return data2;
	}

	private int[] find(int num, Integer [][] data) {
		for(int i = 0; i < 4; i++){
			for(int j = 1 ; j < 8; j ++){
				if(data[i][j] == num){
					int [] res = {i,j};
					return res;
				}
			}
		}
		int [] not = {-1,-1};
		return not;
	}

	private boolean check(Integer[][] data) {
		for(int i =0; i < 4; i++){
			int checknum = (i+1) * 10 + 1;
			for(int j = 0; j < 7; j++){
				if(data[i][j] == checknum){
					checknum++;
				}
				else{
					return false;
				}
			}
		}
		return true;
	}

	private void swap(Integer[][] data, int ind, int j, int i2, int j2) {
		int temp = data[ind][j];
		data[ind][j] = data[i2][j2];
		data[i2][j2] = temp;
	}

	public static void main(String[] args) {
		Main obj = new Main();
		obj.doit();
	}
}