Flip and Shift

This puzzle consists of a random sequence of m black disks and n white disks on an oval-shaped track, with a turnstile capable of flipping (i.e., reversing) three consecutive disks. In Figure 1, there are 8 black disks and 10 white disks on the track. You may spin the turnstile to flip the three disks in it or shift one position clockwise for each of the disks on the track (Figure 1).

Figure 1. A flip and a shift

The goal of this puzzle is to gather the disks of the same color in adjacent positions using flips and shifts. (Figure 2)

Figure 2. A goal sequence

You are to write a program which decides whether a given sequence can reach a goal or not. If a goal is reachable, then write a message ��YES��; otherwise, write a message ��NO��.

Input

The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each of the next T lines gives a test case. A test case consists of an integer, representing the sum of m and n, and a sequence of m+n 0s and 1s, representing an initial sequence. A 0 denotes a white disk and a 1 denotes a black disk. The sum of m and n is at least 10 and does not exceed 30. There is a space between numbers.


Output

The output should print either ��YES�� or ��NO�� for each test case, one per line.


Sample Input

2
18 0 0 1 0 1 1 1 1 0 1 0 0 1 0 0 0 0 1
14 1 1 0 0 1 1 1 0 0 1 1 0 1 0

Output for the Sample Input

YES
NO

 

比较通用的解决方案：

#include <iostream> using namespace std; template<class T> T Abs(T a) { if (a < 0) return -a; return a; } int main() { int Num; cin>>Num; for (int i = 1; i <= Num; ++i) { int n, j; int val, even = 0, doub = 0; bool bYesNo = true; cin>>n; for (j = 1; j <= n; ++j) { cin>>val; if (val) { if (j%2 == 0) ++doub; else ++even; } } if (n%2 != 0) { cout<<"YES"<<endl; continue; } if (Abs(doub-even) <= 1) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0; }

 

另一种方法：

#include <iostream> using namespace std; template<class T> void Swap(T& a, T& b) { T tmp = a; a = b; b = tmp; } int main() { int Num; cin>>Num; for (int i = 1; i <= Num; ++i) { int n, colN = 0, j, k; int val[100]; bool bYesNo = true; cin>>n; for (j = 1; j <= n; ++j) { cin>>val[j]; if (val[j] == val[1]) ++colN; } if (n%2 != 0) { cout<<"YES"<<endl; continue; } for (j = 2; j <= colN; ++j) { if (val[j] == val[1]) continue; bool bHas = false; for (k = j+2; k <= n; k += 2) { if (val[k] == val[1]) { Swap(val[j], val[k]); bHas = true; break; } } if (!bHas) { bYesNo = false; break; } } if (bYesNo) cout<<"YES"<<endl; else cout<<"NO"<<endl; } return 0; }