[枚举]cf228b
来源:互联网 发布:java实训学校 编辑:程序博客网 时间:2024/06/16 16:14
Fox Ciel has a board with n rows and n columns. So, the board consists of n × n cells. Each cell contains either a symbol '.', or a symbol '#'.
A cross on the board is a connected set of exactly five cells of the board that looks like a cross. The picture below shows how it looks.
![](http://espresso.codeforces.com/847cb0bb04204418c35604e1d8aa5a80be062087.png)
Ciel wants to draw several (may be zero) crosses on the board. Each cross must cover exactly five cells with symbols '#', and any cell with symbol '#' must belong to some cross. No two crosses can share a cell.
Please, tell Ciel if she can draw the crosses in the described way.
The first line contains an integer n (3 ≤ n ≤ 100) — the size of the board.
Each of the next n lines describes one row of the board. Thei-th line describes the i-th row of the board and consists of n characters. Each character is either a symbol '.', or a symbol '#'.
Output a single line with "YES" if Ciel can draw the crosses in the described way. Otherwise output a single line with "NO".
5.#...####..####...#......
YES
4################
NO
6.#....####...####..#.##.######.#..#.
YES
6.#..#.######.####..####.######.#..#.
NO
3.........
YES
In example 1, you can draw two crosses. The picture below shows what they look like.
![](http://espresso.codeforces.com/0d13c60e1d2c524d94d834706cc194f821b565f2.png)
In example 2, the board contains 16 cells with '#', but each cross contains 5. Since 16 is not a multiple of 5, so it's impossible to cover all.
从左往右从上往下扫描,容易证明,我们遇到的第一个点一定是一个十字的上顶点,把它涂掉,接下来遇到的第一个点一定也是一个十字的上顶点。
#include <cstdio>char map[110][110];int main(){int n;scanf("%d",&n);for (int i=1;i<=n;i++){for (int j=1;j<=n;j++){char tmp;do tmp = getchar();while (tmp!='.'&&tmp!='#');map[i][j] = tmp=='#';}}for (int i=1;i<=n;i++){for (int j=1;j<=n;j++){if (map[i][j]){if (map[i+1][j]&&map[i+2][j]&&map[i+1][j-1]&&map[i+1][j+1]){map[i][j]=map[i+1][j]=map[i+2][j]=map[i+1][j-1]=map[i+1][j+1] = false;}else{printf("NO");return 0;}}}}printf("YES");return 0;}
- [枚举]cf228b
- CF228B题Fox and Cross
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 枚举
- 自己动手写RTP服务器——传输所有格式的视频
- QTP一些技巧疑点
- 于DLL搜索路径的顺序问题
- Qt Warning: Unescaped backslashes are deprecated!
- hadoop简单实现文本数据全局排序
- [枚举]cf228b
- 如何测量C#代码的运行时间
- 苹果或进军医疗设备与汽车领域 曾与特斯拉谈收购
- 黑马程序员-------java 多线程
- 由remote_login_passwordfile参数引发的问题
- google app engine支持https(ssl)的开发环境配置
- varchar和varchar2的区别
- 160亿美元收购WhatsApp:2年后,Facebook消灭对手的成本翻了10倍
- 拓胜第六十八天~第七十天