zoukankan      html  css  js  c++  java
  • Zoj2100--Seeding(Dfs)

    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


    Author: ZHANG, Zheng
    Source: Zhejiang University Local Contest 2004

    re:拖拉机从左上角开始犁地,黎过的地不能再走回去, 有石头的地不能穿过。看拖拉机能不能走遍所有没有石头的地;

     1 #include <cstdio>
     2 #include <cstring>
     3 #include <iostream>
     4 using namespace std;
     5 char map[10][10]; int ac[4][2]={1, 0, -1, 0, 0, 1, 0, -1};
     6 int m, n, cnt, flag;
     7 void Dfs(int x, int y)
     8 {
     9     int i, j, nx, ny;                         //注意变量设置位置;
    10     if(cnt == 0)
    11     {
    12         flag = 1;
    13         return;
    14     } 
    15     if(flag)
    16         return;
    17     for(i=0; i<4; i++)
    18     {
    19         nx = x + ac[i][0];
    20         ny = y + ac[i][1];
    21         if(nx >= 1 && nx <=m && ny >= 1 && ny <= n && map[nx][ny] == '.')
    22         {
    23             map[nx][ny] = 'S';                    /***********/
    24             cnt--;
    25             Dfs(nx, ny);
    26             cnt++;
    27             map[nx][ny] = '.';                    /*********/
    28         } 
    29     } 
    30 }
    31 int main()
    32 {
    33     while(~scanf("%d %d", &m, &n), m|n)
    34     {
    35         int i, j;  cnt  = n * m;  flag = 0;
    36         for(i=1; i<=m; i++)
    37         {
    38             for(j=1; j<=n; j++)
    39             {
    40                 cin >> map[i][j];
    41                 if(map[i][j] == 'S')
    42                     cnt--; 
    43             }
    44         }
    45         cnt--;
    46         map[1][1] = 'S';
    47         Dfs(1, 1);
    48         if(flag)
    49             printf("YES
    ");
    50         else
    51             printf("NO
    ");
    52     }    
    53     return 0;
    54 }

    //找到一个BUG, 爽~~

  • 相关阅读:
    独立与条件独立
    独立事件、笛卡尔积与矩阵向量乘法
    独立事件、笛卡尔积与矩阵向量乘法
    OpenCV图像增强算法实现(直方图均衡化、拉普拉斯、Log、Gamma)
    等高线的认识
    等高线的认识
    概率相关的证明
    概率相关的证明
    OpenGl中使用着色器的基本步骤及GLSL渲染简单示例
    中英文对照 —— 歌词
  • 原文地址:https://www.cnblogs.com/soTired/p/4703582.html
Copyright © 2011-2022 走看看