Codeforces Round #546 (Div. 2) C - Nastya Is Transposing Matrices

思路：按斜着的行遍历，因为斜着的数字无论怎么转置都一样。

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<string>
#include<set>
#include<map>
#include<cmath>
#define INF 0x3f3f3f3f
#define ll long long
#define mem(ar,num) memset(ar,num,sizeof(ar))
#define me(ar) memset(ar,0,sizeof(ar))
#define lowbit(x) (x&(-x))
#define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define DEBUG cout<<endl<<"DEBUG"<<endl;
using namespace std;
int n, m, a[510][510], b[510][510], ss[250001], k;
multiset<int> m1[1010];
multiset<int> m2[1010];
int main() {
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            cin >> a[i][j],m1[i + j].insert(a[i][j]);
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            cin >> b[i][j],m2[i + j].insert(b[i][j]);;
    for(int i = 1; i <= m + n; i++) 
        if(m1[i] != m2[i]) {
            cout << "NO";
            return 0;
        }
    }
    cout << "YES";
    return 0;
}