Submission #36816035

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <limits>
#include <vector>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <cstdio>
#include <bitset>
#include <queue>
#include <deque>
#include <algorithm>
#include <numeric>
#include <functional>
#include <stack>
#include <cmath>
#include <string>
#include <cstring>
#include <complex>
#include <cassert>
#include <cstdlib>
using namespace std;

typedef long long ll;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const int INF = (1<<30)-1;
const int MOD = 1e9+7;
const ll LINF = (1ll<<62)-1;

#define REP(i,n) for(int i=0;i<(n);++i)
#define COUT(x) cout<<(x)<<"\n"
#define COUT16(x) cout << fixed << setprecision(16) << (x) << "\n"

int main(){
    //input
    int h,w;cin >> h >> w;
    vector<string> s(h),t(h);
    vector<string> ss,tt;
    for(int i=0;i<h;i++){
        cin >> s[i];
    }
    for(int i=0;i<h;i++){
        cin >> t[i];
    }
    //calc
    for(int i=0;i<w;i++){
        string moji = "";
        for(int j=0;j<h;j++){
            moji += string({s[j][i]});
        }
        //COUT(moji);
        ss.push_back(moji);
    }
    sort(ss.begin(),ss.end());
    for(int i=0;i<w;i++){
        string moji = "";
        for(int j=0;j<h;j++){
            moji += string({t[j][i]});
        }
        //COUT(moji);
        tt.push_back(moji);
    }
    sort(tt.begin(),tt.end());

    //output
    bool flag = true;
    for(int i=0;i<w;i++){
        if(tt[i] != ss[i])flag = false;
    }
    if(flag == true)COUT("Yes");
    else COUT("No");
}

Submission Info

Judge Result