287A - IQ Test - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi (3.141592653589)
#define mod 1000000007
#define float double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define int long long int 
#define vi(v) vector<int>v;
#define vec(v,n) vector<int>v(n);
#define vii(v) vector<ll>v;
#define input(a,n) for(int i=0;i<n;i++) cin>>a[i];
#define min3(a, b, c) min(c, min(a, b))
#define min4(a, b, c, d) min(d, min(c, min(a, b)))
#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define rep(i,m,n) for(int i=m;i<n;i++)
#define UMAP(ump) unordered_map<int,int>ump; 
#define fast ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#define SORT(V) sort(v.begin(),v.end());
#define SORT_ARRAY(arr,n) sort(arr,arr+n);
void print_array(int*arr,int n){
for(int i=0;i<n;i++){
cout<<arr[i]<<" ";
}cout<<endl;
}
void print_vector(vector<int>v){
for(auto it : v){
cout<<it<<" ";
}cout<<endl;
}



void solve(){

    vector<vector<int>>v(4,vector<int>(4,0));
    rep(i,0,4){
        rep(j,0,4){
            char c;
            cin>>c;
            if(c=='#'){
                v[i][j]=0;
                
            }
            else{
                v[i][j]=1;
            }
        }
    }


    rep(i,0,3){
        rep(j,0,3){
            int sum=v[i][j]+v[i][j+1]+v[i+1][j]+v[i+1][j+1];
            if(sum==1 || sum==3 || sum==0 || sum==4){
                cout<<"YES"<<endl;
                return;
            }

        }
    }

    cout<<"NO"<<endl;
    
    
    
}
int32_t main(){
fast
int t=1;
// cin>>t;
while(t--){
solve();
}
return 0;
}