B - Coloring Matrix(模拟)

B - Coloring Matrix (atcoder.jp)

通过旋转a，能否使得a是b的子图，也就是a[i,j] = 1 ,b[i,j] 一定是1 ，最多旋转3次

输入

2
0 0
0 0
1 1
1 1
 

输出

Yes

#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <stack>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;	-- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =1e2 + 10 ,M = N *2  ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8,DNF = 1e18;
const int mod = 998244353 ,base= 20010;
const LL LNF=(LL) INF * INF;




int a[N][N],b[N][N],c[N][N];
void solve()
{
	int n;cin >> n;
	fu(i,1,n) fu(j,1,n) cin >> a[i][j];
	fu(i,1,n) fu(j,1,n) cin >> b[i][j];
	
	int q = 4; 
	while(q -- )
	{
		bool f = 0;
		fu(i,1,n)
		fu(j,1,n)
		if(a[i][j] == 1  && b[i][j] == 0 ) 
		{
			f = 1 ;break;
		}
		if(!f)
		{
			cout << "Yes\n";return;
		}
		
		fu(i,1,n)
		fu(j,1,n)
		c[i][j] = a[n + 1 - j][i];
		swap(a,c);
		
		
	}
	cout << "No\n";
}


signed main()
{
//  freopen("1.txt","r",stdin);
//	#define int long long 
//	init(N-1);
    ios
//	cout << fixed<<setprecision(2);
    int t=1;
//   	cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
		solve();
    }


    return 0;
}