Seeding
2015-08-05 15:37
363 查看
Time Limit: 2 Seconds
Memory Limit: 65536 KB
It is spring time and farmers have to plant seeds in the field. Tom has a nice field, which is a rectangle with n * m squares. There are big stones in some of the squares.
Tom has a seeding-machine. At the beginning, the machine lies in the top left corner of the field. After the machine finishes one square, Tom drives it into an adjacent square, and continues seeding. In order to protect the machine, Tom will not drive it
into a square that contains stones. It is not allowed to drive the machine into a square that been seeded before, either.
Tom wants to seed all the squares that do not contain stones. Is it possible?
Input
The first line of each test case contains two integers n and m that denote the size of the field. (1 < n, m < 7) The next n lines give the field, each of which contains m characters. 'S' is a square with stones, and '.' is a square without stones.
Input is terminated with two 0's. This case is not to be processed.
Output
For each test case, print "YES" if Tom can make it, or "NO" otherwise.
Sample Input
4 4
.S..
.S..
....
....
4 4
....
...S
....
...S
0 0
Sample Output
YES
NO
Memory Limit: 65536 KB
It is spring time and farmers have to plant seeds in the field. Tom has a nice field, which is a rectangle with n * m squares. There are big stones in some of the squares.
Tom has a seeding-machine. At the beginning, the machine lies in the top left corner of the field. After the machine finishes one square, Tom drives it into an adjacent square, and continues seeding. In order to protect the machine, Tom will not drive it
into a square that contains stones. It is not allowed to drive the machine into a square that been seeded before, either.
Tom wants to seed all the squares that do not contain stones. Is it possible?
Input
The first line of each test case contains two integers n and m that denote the size of the field. (1 < n, m < 7) The next n lines give the field, each of which contains m characters. 'S' is a square with stones, and '.' is a square without stones.
Input is terminated with two 0's. This case is not to be processed.
Output
For each test case, print "YES" if Tom can make it, or "NO" otherwise.
Sample Input
4 4
.S..
.S..
....
....
4 4
....
...S
....
...S
0 0
Sample Output
YES
NO
#include<stdio.h> #include<cstring> char s[10][10]; int c[10][10]; int a,b,ans; int n[4]={0,0,1,-1}; int m[4]={1,-1,0,0}; int dfs(int x,int y,int q) { if(q==0) { return 1; } c[x][y]=1; for(int i=0;i<4;i++) { int nx=x+n[i]; int ny=y+m[i]; if(nx<a&&ny<b&&nx>=0&&ny>=0&&c[nx][ny]!=1&&dfs(nx,ny,q-1)) return 1; } c[x][y]=0; return 0; } int main() { int i,j,k; while(scanf("%d%d",&a,&b),a|b) { for(i=0;i<a;i++) scanf("%s",s[i]); int count=0; for(i=0;i<a;i++) for(j=0;j<b;j++) if(s[i][j]=='.') { c[i][j]=0; count++; } else c[i][j]=1; if(dfs(0,0,count-1)) printf("YES\n"); else printf("NO\n"); } return 0; }
相关文章推荐
- linux电子书解决方案Calibre
- 单链表
- 12. Element attributes 属性
- 华为软件编程规范和范例 5 ——可测性
- 南邮 OJ 1418 清扫
- Jstat使用详解
- 机器学习实战之朴素贝叶斯进行文档分类(Python 代码版)
- activiti框架 数据库设计说明
- 单链表
- C++易混淆概念
- 循环日程表问题
- python问题:IndentationError:expected an indented block错误解决
- iOS开发之倒计时
- 【C++】拷贝构造函数和赋值函数
- 伸展树复习 (bzoj 1251 序列终结者)
- MySQL 主主(双主)复制
- 最长上升子序列O(NlogN)算法
- 如何在Oracle中复制表结构和表数据
- NOI2010 能量采集
- gitlab升级方法