Just an Old Puzzle

http://acm.hdu.edu.cn/showproblem.php?pid=6620

总结：

偶数列数：逆序对差和两个局面空格行数差奇偶相同就可达 

奇数列数：逆序对数目只能偶数

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 8e19
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
//#define pii pair<int,int>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=1e6+9;
const int maxm=1e6;
const int mod=1e9+7;

int a[20];


int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);


    int T;
    sfi(T);
    while(T--)
    {
        int x=0;

        int ans=0;
        for(int i=1;i<=16;i++)
        {
            sfi(a[i]);
            if(a[i]==0)
            {
                x=i/4+(i%4!=0);
            }
            else
            {
                for(int j=1;j<i;j++)
                {
                    if(a[j]==0) continue;
                    if(a[j]>a[i]) ans++;
                }
            }

        }



        if((4-x)%2==(ans%2)) puts("Yes");
        else puts("No");

    }


    return 0;
}