zoj2100Seeding(水题)
2012-11-15 15:55
344 查看
Seeding
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
从左上角,一次性走完所有的点。
当然可以不用visited数组
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
从左上角,一次性走完所有的点。
#include <iostream> #include <cstring> using namespace std; const int MAXN = 10; char maps[MAXN][MAXN]; bool visited[MAXN][MAXN]; const int moves[4][2] = {0,-1,1,0,-1,0,0,1}; int m,n,stone; bool flag; bool DFS(int x,int y,int level) { if(n * m - stone == level) { flag = true; return true; } for(int i=0;i<4;i++) { int p = x + moves[i][0]; int q = y + moves[i][1]; if(p>=1&&p<=n&&q>=1&&q<=m&&maps[p][q]=='.'&&!visited[p][q]) { visited[p][q] = true; DFS(p,q,level+1); if(flag) return true; visited[p][q] = false; } } return false; } int main() { freopen("in.txt","r",stdin); int i,j; while(cin>>n>>m&&n+m) { memset(maps,0,sizeof(maps)); memset(visited,false,sizeof(visited)); stone = 0; for(i=1;i<=n;i++) { for(j=1;j<=m;j++) { cin>>maps[i][j]; if(maps[i][j]=='S') stone++; } } visited[1][1] = true; flag = false; bool ans = DFS(1,1,1); if(ans) cout<<"YES"<<endl; else cout<<"NO"<<endl; } }
当然可以不用visited数组
#include <iostream> #include <cstring> using namespace std; #pragma warning(disable : 4996) const int MAXN = 10; char maps[MAXN][MAXN]; const int moves[4][2] = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}}; int m, n, stone; bool flag; void DFS(int x, int y, int cnt) { if(stone + cnt == n * m) { flag = true; return; } for(int i = 0; i < 4; i++) { int p = x + moves[i][0]; int q = y + moves[i][1]; if(p >= 1 && p <= n && q >= 1 && q <= m && maps[p][q] == '.') { maps[p][q] = 'S'; DFS(p, q, cnt + 1); maps[p][q] = '.'; } } } int main() { freopen("in.txt", "r", stdin); int i, j; while(cin >> n >> m) { if(n == 0 && m == 0) { break; } stone = 0; for(i = 1; i <= n; i++) { for(j = 1; j <= m; j++) { cin >> maps[i][j]; if(maps[i][j] == 'S') { stone++; } } } flag = false; maps[1][1] = 'S'; DFS(1, 1, 1); if(flag) { cout << "YES" << endl; } else { cout << "NO" << endl; } } return 0; }
相关文章推荐
- zoj2100Seeding(水题)
- ZOJ 2724 Windows Message Queue (优先级队列,水题,自己动手写了个最小堆)
- zoj 3809 The Himalayas 水题 The 2014 ACM-ICPC Asia Mudanjiang Regional First Round
- ZOJ Problem Set - 3023 (水题)
- zoj1813水题
- zoj 2947 Abbreviation 水题
- zoj 1730 Crazy Tea Party(水题吗?我不会啊!!!)
- HDU1046 POJ1450 UVALive2334 ZOJ1037 Gridland【数学计算+水题】
- POJ1003 UVALive2294 HDU1056 ZOJ1045 Hangover【数学计算+水题】
- 【ZOJ1586】【MST水题】【prim】
- zoj 3819 Average Score(水题)
- zoj 1874 || poj 1562 Primary Arithmetic(水题。)
- zoj 2514水题
- zoj 2443 水题。。。
- zoj水题分类
- zoj 2812 Quicksum 水题
- UVALive5429 UVA382 POJ1528 HDU1323 ZOJ1284 Perfection【整除+水题】
- UVALive5389 UVA414 POJ1493 ZOJ1339 Machined Surfaces【输入输出+水题】
- ZOJ 3827 Information Entropy 水题
- ZOJ 1494 Climbing Worm 数学水题