PKU 3702 Chessman

Description

There's an n × 1 chessboard filled with some chessman, where n is infinity. For each chessman, you can make any move of the following:

1.Jump to the 4th grid on the right or left, if that grid is empty. For example:
...*........
=>
.......*....

...****.....
=>
....****....

....*.**....
=>
...**.*.....

2. Jump to the 3rd grid on the right, if that grid is empty, as well as the second and the first grid on the right has and has not a chessman respectively. Then, after this the junp is taken, the first grid the chessman jumped over will have a chessman, and the second grid the chessman jumped over will be empty. For example:

...*.*.....
=>
....*.*....

3.Jump to the 2nd grid on the right, if that grid is empty and the grid the chessman is about to jump over has a chessman. Then, the grid the chessman jumped over will be empty. For example:

...**.....
=>
.....*....

Given the first 30 girds on the left (has or has not chessman) of two chessboards, the rest grids being all empty, decide whether the first chessboard can be changed to the second chessboard with those three kinds of moves listed above?

Input

The first line of the input is the number of test cases. For each case there are two lines. Each line contains 30 characters. '.' represents empty grid. '*' represents a chessman. There is a blank line before each test case.

Output

For each test case output the answer on a line: "YES" or "NO". 　

Sample Input

6



........................*.....

.........................*....



......*.......*...............

.........................*....



******************************

................**............



*...*..**.....................

...........................***



*******.****.**************.**

..**...*..*..*...**.*...**.*..



*******.****.**************.**

..**...**.*..*...**.*...**.*..

Sample Output

NO

NO

YES

NO

YES

NO



直接说思路吧。将数据分成四组，安装%4划分，只要计数就可以了。之所以这样，因为每组之间可以只有移动，根据规则1. 然后根据规则2，3，可以修改4组之间的数量关系，这就是dfs的内容。关键在于规则1的只有移动，使得组内的位置关系没有意义，因此只要从计数考虑就可以了。




//#include "stdafx.h"
//============================================================================
// Name        : acmcpp.cpp
// Author      : Yubo Chow
// Version     :
// Copyright   : Your copyright notice
// Description : Hello World in C++, Ansi-style
//============================================================================

#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <queue>
#include <math.h>
#include <algorithm>
#include <set>
#include <limits.h>
#include <float.h>
#include <bitset>
#include <cmath>
#include <vector>
#include <map>
#include <list>
#include <string.h>
using namespace std;

bool m[31][31][31][31];

void dfs(int p0, int p1, int p2, int p3) {
  if (p0 < 0 || p1 < 0 || p2 < 0 || p3 < 0 || m[p0][p1][p2][p3]) {
    return;
  }

  m[p0][p1][p2][p3] = true;

  dfs(p0 - 1, p1 + 1, p2 - 1, p3 + 1);
  dfs(p0 + 1, p1 - 1, p2 + 1, p3 - 1);
  dfs(p0 - 1, p1 - 1, p2 + 1, p3);
  dfs(p0, p1 - 1, p2 - 1, p3 + 1);
  dfs(p0 + 1, p1, p2 - 1, p3 - 1);
  dfs(p0 - 1, p1 + 1, p2, p3 - 1);
}

int main() {
#ifndef ONLINE_JUDGE
  freopen("case.txt", "r", stdin);
#endif

  int n;
  cin >> n;

  char a[32], b[32];
  while (n--) {
    scanf("%s%s", a, b);
    int p[4];
    memset(m, 0, sizeof m);
    memset(p, 0, sizeof p);
    for (int i = 0; i < 30; ++i) {
      p[i % 4] += (a[i] == '*');
    }

    dfs(p[0], p[1], p[2], p[3]);
    memset(p, 0, sizeof p);
    for (int i = 0; i < 30; ++i) {
      p[i % 4] += (b[i] == '*');
    }
    printf("%s/n", m[p[0]][p[1]][p[2]][p[3]] ? "YES" : "NO");
  }

  return 0;
}