Submission #1105102

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a); i<(b); i++)
#define all(c) (c).begin(),(c).end()
#define rall(c) (c).rbegin(),(c).rend()
#define sort(v,n) sort(v,v+n);
#define vsort(v) sort(v.begin(),v.end());
#define vvsort(v) sort(v.begin(),v.end(),greater<int>());
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
typedef pair<int,int> p;
typedef pair<ll,ll> lp;
typedef priority_queue<int> pq;
typedef priority_queue<int,vector<int>,greater<int> > rpq;
bool is_uruu(int y) {
        return y % 4 == 0 && (y % 100 != 0 || y % 400 == 0);
}
const ll MOD=1e9+7;
const double PI=acos(-1.0);
//----------------------------------------------------------------------------------------------------------------------------------//

int main(){
        int n,m;
        string s[51][51];
        string d[51][51];
        cin>>n>>m;
        for(int i=0; i<n; i++) {
                for(int j=0; j<n; j++) {
                        cin>>s[i][j];
                }
        }
        for(int i=0; i<m; i++) {
                for(int j=0; j<m; j++) {
                        cin>>d[i][j];
                }
        }
        int sum;
        for(int i=0; i<=n-m; i++) {
                for(int j=0; j<=n-m; j++) {
                        sum=0;
                        for(int e=i; e<m; e++) {
                                for(int f=j; f<m; f++) {
                                        if(s[e][f]==d[e-i][f-j]) {
                                                sum++;
                                        }
                                }
                        }
                }
                if(sum==n*n) {
                        cout<<"Yes"<<endl;
                        return 0;
                }
        }
        cout<<"No"<<endl;
}

Submission Info

Judge Result