hdoj5600N bulbs

N bulbs Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 287    Accepted Submission(s): 162 Problem Description N bulbs are in a row from left to right,some are on, and some are off.The first bulb is the most left one. And the last one is the most right one.they are numbered from 1 to n,from left to right. in order to save electricity, you should turn off all the lights, but you're lazy. coincidentally,a passing bear children paper(bear children paper means the naughty boy), who want to pass here from the first light bulb to the last one and leave. he starts from the first light and just can get to the adjacent one at one step. But after all,the bear children paper is just a bear children paper. after leaving a light bulb to the next one, he must touch the switch, which will change the status of the light. your task is answer whether it's possible or not to finishing turning off all the lights, and make bear children paper also reach the last light bulb and then leave at the same time.   Input The first line of the input file contains an integer T, which indicates the number of test cases. For each test case, there are 2 lines. The first line of each test case contains 1 integers n. In the following line contains a 01 sequence, 0 means off and 1 means on. *  1≤T≤10 *  1≤N≤1000000   Output There should be exactly T lines in the output file. The i-th line should only contain "YES" or "NO" to answer if it's possible to finish.   Sample Input 1 5 1 0 0 0 0   Sample Output YES Hint Child's path is: 123234545 all switchs are touched twice except the first one.   Source BestCoder Round #67 (div.2)

我们注意到总的操作次数是跟$n$奇偶的。这个很重要，也就是如果$1$的数量和$n$不同奇偶，那么一定无解。

那么现在问题是$1$和$n$同奇偶的情况下，是不是一定有解？答案是显然的。

因为$1$和$n$同奇偶，所以$0$的个数是偶数，我们发现当我们从$1$走到$i$时，假设我们往回走到左边某个点$k$，再走回来$i$，那么你会发现有且仅有$k$和$i$这两个数被设成没有操作。

也就是说我们可以每次任意选择两个点设成没有操作，然而不需操作的点数是偶数个，所以刚好可以满足。

#include<cstdio>
#include<cstdlib>
#include<cstring>
using namespace std;
int main()
{
    int t,i,j,k,n,m,ans;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);ans=0;
        for(i=0;i<n;++i){
            scanf("%d",&k);
            if(k)ans++;
        }
        if(((ans&1)&&(n&1))||((ans%2==0&&n%2==0))){
            printf("YES\n");
        }
        else {
            printf("NO\n");
        }
    }
    return 0;
}