时间限制:500MS  内存限制:65535K
提交次数:37 通过次数:15

题型: 编程题   语言: G++;GCC

Description

The opening ceremony of the 28th Asia Game is coming. In order to prevent the game from being attacked by terrorists, Asia Compete Machinery (ACM) takes lots operations as security measures.

Mine sweeping is one of the most important operations, so a special machine has been invented to detect mines. We assume the fields which need to be detected are configuration as several continuous grids, and there is at most one mine in each grid (See Fig a).

  

Fig a                                    Fig b

When using the machine to detect the ith grid, the machine will provide the number xi, which means the total number of mines in the ith(i-1)th and (i+1)th grids. Except the first and last grid, the detect result of the first grid is the number of 1st and 2nd grid, and the result of the last grid is the last and the last but two grids. The approximate detect result for Fig a is as Fig b. However, some of these machines may have bugs and provide unreal result. For example, one of the unreal detect result for Fig a is as Fig c. The red grid is unreal result.

Fig c

It is clearly that Fig b is possible result, but Fig c is not. Now, give you the detect result for a given field, please calculate if this result is possible.

输入格式

The first line of input is an integer T (T <= 100), indicate the number of test cases.

Each test case contains two lines.

The first line of each test case is an integer N (3 <= N <= 1000), indicate the length of the given field. The second line contains N integers Xi (0 <= Xi <= 3), each Xi indicate the detect result for grid i.

输出格式

If the detect result is possible, please output “YES”, otherwise, output “NO”.

输入样例

3
13
1 1 1 1 1 1 1 1 1 0 1 2 2
13
1 1 1 1 1 2 1 1 1 0 1 2 2
7
1 2 3 3 3 2 1

输出样例

YES
NO
YES
思路:模拟, 枚举第一个数管辖范围可能的情况, 那么考虑第2 到 第 n - 1 个数时,只需确定该数后一个数需要填什么,特别的n同样是只管辖 n 和 n - 1两个范围,需要特殊考虑。
 #include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
using namespace std;
int vis[], fig[];//vis[] = 1表示i处为炸弹,vis[] = -1表示必定没有炸弹
int suc, n;
int calc(int m)
{
int cnt = ;
if(vis[m - ] == ) cnt++;
if(vis[m] == ) cnt++;
return cnt;
}
bool check()
{
for(int i = ; i < n; ++i)
{
int nd = fig[i] - calc(i);
if(nd == ) vis[i + ] = -;
else if(nd == ) vis[i + ] = ;
else return false;
}
int nd = calc(n);
if(nd == fig[n]) return true;
else return false;
}
int main()
{
// freopen("in.txt","r",stdin);
int _;
scanf("%d",&_);
while(_--)
{
memset(vis, , sizeof vis);
scanf("%d",&n);
for(int i = ; i <= n; ++i) scanf("%d",&fig[i]);
suc = ;
if(fig[] == ) {
vis[] = , vis[] = -;
if(check()) suc = ;
if(!suc) {
vis[] = -, vis[] = ;
if(check()) suc = ;
}
}
else if(fig[] == ) {
vis[] = vis[] = ;
if(check()) suc = ;
}
else if(fig[] == ) {
vis[] = vis[] = -;
if(check()) suc = ;
}
else suc = ;
if(suc) printf("YES\n");
else printf("NO\n");
}
}

8659 Mine Sweeping的更多相关文章

  1. TOJ 3184 Mine sweeping

    描述 I think most of you are using system named of xp or vista or win7.And these system is consist of ...

  2. 【HDOJ】3316 Mine sweeping

    简单BFS. #include <iostream> #include <cstdio> #include <cstring> #include <cstdl ...

  3. Mine Number(搜索,暴力) ACM省赛第三届 G

    Mine Number Time Limit: 1000ms   Memory limit: 65536K  有疑问?点这里^_^ 题目描述 Every one once played the gam ...

  4. [2012山东省第三届ACM大学生程序设计竞赛]——Mine Number

    Mine Number 题目:http://acm.sdut.edu.cn/sdutoj/problem.php? action=showproblem&problemid=2410 Time ...

  5. C language 模拟 win的经典游戏——扫雷

    让我们在terminal下愉快的...扫雷 昨天跟奇葩霖聊起"雷区"这个敏感词汇,然后非常荣幸的... 应该轰炸不到我.. . 后来百无聊赖的去玩了把扫雷.然后发现我之前都是乱扫的 ...

  6. SVN版本冲突,导致出现Files 的值“ < < < < < < < .mine”无效

    只要根据错误提示,找到相应文件夹下的\obj\Debug文件夹下的 相应名字.csproj.FileListAbsolute.txt, 打开并删除含有'<<<<<< ...

  7. Files 的值“<<<<<<< .mine”无效。路径中具有非法字符

    解决冲突,告诉SVN这个问题已解决(Resolved). 一般更简单些:在你的工程OBJ/DEBUG目录下,找到 工程名.csproj.FileListAbsolute.txt的文件打开并删除含有'& ...

  8. SVN Files 的值“ < < < < < < < .mine”无效。路径中具有非法字符。

    错误 1 Files 的值“ < < < < < < < .mine”无效.路径中具有非法字符.     今天使用SVN进行更新的时候,出现了如上问题,想起卓 ...

  9. Files 的值“ < < < < < < < .mine”无效。路径中具有非法字符。

    出现这个问题的原因是,用svn时,发生了冲突.解决方法:先解决代码冲突,然后在你的工程OBJ/DEBUG目录下,找到 工程名.csproj.FileListAbsolute.txt的文件打开并删除含有 ...

随机推荐

  1. io流对文件读写操作

    public static void main(String[] args) throws IOException { BufferedReader reader = new BufferedRead ...

  2. August 18th 2016 Week 34th Thursday

    Comedy is acting out optimism. 喜剧就是将乐观演绎出来. Being optimistic or pessimistic, that is all about your ...

  3. poj1456(贪心+并查集)

    题目链接: http://poj.org/problem?id=1456 题意: 有n个商品, 已知每个商品的价格和销售截止日期, 每销售一件商品需要花费一天, 即一天只能销售一件商品, 问最多能买多 ...

  4. 玩转Java对象和XML相互转换

    最近在项目中一直出现Java对象和XML之间的相互转换,一开始由于项目很庞大,我又是临时调度过去,导致在按照项目组长的要求进行写代码的同时,总是在这块云里雾里,最近才慢慢开始搞清楚项目中具体的使用缘由 ...

  5. max file descriptors [4096] for elasticsearch process likely too low, increase to at least [65536]

    在/etc/syscurity/limits.conf 加入以下两行: elastic hard nofile 65536 elastic soft nofile  65536 #备注:elastic ...

  6. Java集合源码学习(四)HashMap分析

    ArrayList.LinkedList和HashMap的源码是一起看的,横向对比吧,感觉对这三种数据结构的理解加深了很多. >>数组.链表和哈希表结构 数据结构中有数组和链表来实现对数据 ...

  7. css控制文字显示长度,超过用省略号替代

    .line_text { width:200px; white-space:nowrap; overflow:hidden; text-overflow:ellipsis; } <span cl ...

  8. 【翻译十二】java-并发之活性

    A concurrent application's ability to execute in a timely manner is known as its liveness. This sect ...

  9. 《Spring 3.x 企业应用开发实战》目录

    图书信息:陈雄华 林开雄 编著 ISBN 978-7-121-15213-9 概述: 第1章:对Spring框架进行宏观性的概述,力图使读者建立起对Spring整体性的认识. 第2章:通过一个简单的例 ...

  10. Solr入门之(4)配置文件solr.xml

    <?xml version="1.0" encoding="UTF-8" ?> <!-- This is an example of a si ...