题意:
T组输入,每组输入n,m,给你n种为2×2瓷砖(数量不限),让你构造m*m的矩阵,该矩阵为轴对称矩阵(沿主对角线对称,即左上到右下),问是否能够构造出这样一个矩阵
题解:
1.m为奇数肯定不能构造
2.只要有一种瓷砖右上和左下相同,那么全部使用这一种瓷砖即可构造
code:
#include<bits/stdc++.h>
#pragma GCC optimize(2)
#define rep(i,a,n) for (int i=a;i<=n;i++)//i为循环变量,a为初始值,n为界限值,递增
#define per(i,a,n) for (int i=a;i>=n;i--)//i为循环变量, a为初始值,n为界限值,递减。
using namespace std;
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
const int INF = 0x3f3f3f3f;
const ll LINF = 1ll<<60;
const int mod=1e9+7;
ll read()//快读
{
ll w = 1, s = 0;
char ch = getchar();
while (ch < '0' || ch>'9') { if (ch == '-') w = -1; ch = getchar(); }
while (ch >= '0' && ch <= '9') { s = s * 10 + ch - '0'; ch = getchar(); }
return s * w;
}
void solve(){
int n,m;
cin>>n>>m;
int a,b,c,d;
int f=0,f2=0;
rep(i,1,n) {
cin>>a>>b>>c>>d;
if(b==c) f=1;
}
if(m%2==0) f2=1;
if(f2&&f) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
int main(){
int _;cin>>_;while(_--) solve();
return 0;
}