【Codeforces】 A. Computer Game

A. Computer Game

The question ：

To give you one 2*N Lattice of , from （1,1） Go to the （2,n）, You can walk up, down, left and right , You can also walk sideways , Every time I go x,y Step no more than 1. There will be obstacles on the way , Ask if you can walk to （2,n）. It is known that （1,1） and （2,n） There are no obstacles .

1 Stands for obstacles ,0 It means there is no .

Examples ：

Ideas ：

Just started to use dfs Write , then t 了 . Later, I found it was very simple after reading the solution ：
As long as you encounter up and down 1 Of , You can't go . Such as ：
0100 0010 0111
0100 perhaps 0110 perhaps 1010

So just go through it , See if there is any str(1)(i) == str(2)(i) that will do .

AC Code ：

#include<bits/stdc++.h>
using namespace std;
int t, n;
int flag;
string a[2];
int main(){
    
    cin >> t;
    while(t--){
    
        cin >> n;
        flag = 1;
        a[0].clear(); a[1].clear();
        cin >> a[0] >> a[1];
        for(int i = 0; i < n; i++)
            if( a[0][i]  == '1' && a[1][i] == '1') flag = 0;
        if(!flag) cout << "NO" << endl;
        else cout << "YES" << endl;
    }
}