HDOJ 5600-N bulbs【模拟】

￡神魔★判官ぃ 2022-07-24 09:10 137阅读 0赞

#  #

# N bulbs #

**Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)**

Total Submission(s): 788 Accepted Submission(s): 401

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)][BestCoder Round _67 _div.2]

解题思路：

按照每一位每一位的操作，就是从一个位置走到头，拐回来走到这个位置的后一个，我们可以看出1这个位置是直接可以跳过的，而0这个位置要将下一位反转。

#include<stdio.h>
    #include<string.h>
    #include<algorithm>
    using namespace std;
    int map[1000020];
    int main()
    {
    	int t;
    	scanf("%d",&t);
    	while(t--)
    	{
    		int n;
    		scanf("%d",&n);
    		for(int i=1;i<=n;i++)
    		{
    			scanf("%d",&map[i]);
    		}		
    		for(int i=1;i<=n-1;i++)
    		{
    			if(map[i]==0)
    			{
    				map[i+1]=1-map[i+1];
    			}
    		}
    		if(map[n])
    		{
    			printf("YES\n");
    		}
    		else
    		printf("NO\n");
    	}
    	return 0;
    }

[BestCoder Round _67 _div.2]: http://acm.hdu.edu.cn/search.php?field=problem&key=BestCoder+Round+%2367+%28div.2%29&source=1&searchmode=source