HDU6620 Just an Old Puzzle

Just an Old Puzzle

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 262144/262144 K (Java/Others)
Total Submission(s): 364 Accepted Submission(s): 228

Problem Description
You are given a 4 × 4 grid, which consists of 15 number cells and an empty cell.
All numbers are unique and ranged from 1 to 15.
In this board, the cells which are adjacent with the empty cell can move to the empty cell.
Your task is to make the input grid to the target grid shown in the figure below.
In the following example (sample input), you can get the target grid in two moves.

Input
The first line contains an integer T (1 <= T <= 10^5) denoting the number of test cases.
Each test case consists of four lines each containing four space-separated integers, denoting the input grid. 0 indicates the empty cell.

Output
For each test case, you have to print the answer in one line.
If you can’t get the target grid within 120 moves, then print ‘No’, else print ‘Yes’.

Sample Input

2
1 2 3 4
5 6 7 8
9 10 0 12
13 14 11 15
1 2 3 4
5 6 7 8
9 10 11 12
13 15 14 0

Sample Output

Yes
No

HINT

逆反数就是前面的数比后面的数大a[i]>a[j]
Code：

#include <bits/stdc++.h>
using namespace std;
int main( )
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        int a[20];
        memset(a,0,sizeof(a));
        int flag;
        for(int i=1; i<=16; i++)
        {
            scanf("%d",&a[i]);
            if(a[i]==0)
            {
                flag=i/4+(i%4!=0);
            }
        }

        int abs=0;
        for(int i=1; i<=16; i++)
        {
            if(a[i]==0)
                continue;
            for(int j=i+1; j<=16; j++)
            {
                if(a[j]==0)
                {
                    continue;
                }
                if(a[i]>a[j])
                    abs++;
            }
        }
        //printf("%d %d\n",abs,flag);
        if(flag%2==0&&abs%2==0||flag%2==1&&abs%2==1)
            printf("Yes\n");
        else
            printf("No\n");

    }
    return 0;
}