C. Nastya Is Transposing Matrices

http://codeforces.com/contest/1136/problem/C 

题意：给矩阵A，B，问经过数次选择A的子方阵转置，能否变成B；

思路：经过数次只能调换反对角线的元素，所以判断这些元素是否相同； 

#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<ctime>
#include<map>
#include<stack>
#include<string>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-6
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define FAST ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);endl '\n'
ll gcd(ll a,ll b){while(b^=a^=b^=a%=b);return a;}
const int maxn=2e5+9;
const int mod=998244353;

template <class T>
inline void sc(T &ret)
{
    char c;
    ret = 0;
    while ((c = getchar()) < '0' || c > '9');
    while (c >= '0' && c <= '9')
    {
        ret = ret * 10 + (c - '0'), c = getchar();
    }
}

ll power(ll x,ll n)
{
    ll ans=1;
    while(n)
    {
        if(n&1) ans=ans*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return ans;
}

vector<int> A[maxn],B[maxn];
int a[509][509],b[509][509];
int main()
{
    int n,m;
    while(cin>>n>>m)
    {
        for(int i=0;i<n+m-2;i++) A[i].clear(),B[i].clear();
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                cin>>a[i][j];
                A[i+j].push_back(a[i][j]);
            }
        }
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<m;j++)
            {
                cin>>b[i][j];
                B[i+j].push_back(b[i][j]);
            }
        }
        bool f=1;
        for(int i=0;i<n+m;i++)
        {
            sort(A[i].begin(),A[i].end());
            sort(B[i].begin(),B[i].end());
            for(int j=0;j<A[i].size();j++)
            {
                //cout<<A[i][j]<<" "<<B[i][j];
                if(A[i][j]!=B[i][j])
                {
                    f=0;
                    break;
                }
            }
            //cout<<endl;
            if(!f) break;
        }
        if(f) cout<<"YES\n";
        else cout<<"NO\n";
    }
    return 0;
}