欢乐赛#55 T5 题解

暴力

#include <bits/stdc++.h>
using namespace std;
int t,n;
int a[1005][1005];
int main(){
	cin>>t;
    while (t--){
        cin>>n;
        bool flag=true;
        for (int i=1;i<=n;i++){
            for (int j=1;j<=n;j++){
                cin>>a[i][j];
            }
        }
        for (int i=1;i<=n;i++){
            for (int j=1;j<=n;j++){
                if (a[i][j]!=a[i][n-j+1]) flag=false;//判断左右是否对称
                if (a[j][i]!=a[n-j+1][i]) flag=false;//判断上下是否对称
            }
        }
        cout<<(flag? "YES":"NO")<<endl;
    }
	return 0;
}