hihocoder offer收割编程练习赛12 C 矩形分割

思路：

模拟，深搜。

实现：

 #include <iostream>
 #include <cstdio>
 #include <string>
 using namespace std;

 const int dx[] = { , , , - };
 const int dy[] = { -, , ,  };

 int n, m, cnt = ;
 int a[][];
 bool vis[][];

 void dfs(int x, int y)
 {
     vis[x][y] = true;
     for (int i = ; i < ; i++)
     {
         int nx = x + dx[i];
         int ny = y + dy[i];
         if (nx >=  && nx <  * n && ny >=  && ny <  * m && !a[nx][ny] && !vis[nx][ny])
         {
             dfs(nx, ny);
         }
     }
 }

 int main()
 {
     scanf("%d %d", &n, &m);
     getchar();
     for (int i = ; i < n; i++)
     {
         for (int j = ; j < m; j++)
         {
             char c = getchar();
             if (c == '/')
             {
                 a[ * i][ * j] = ;
                 a[ * i][ * j + ] = ;
                 a[ * i][ * j + ] = ;
                 a[ * i + ][ * j] = ;
                 a[ * i + ][ * j + ] = ;
                 a[ * i + ][ * j + ] = ;
                 a[ * i + ][ * j] = ;
                 a[ * i + ][ * j + ] = ;
                 a[ * i + ][ * j + ] = ;
             }
             else if (c == '\\')
             {
                 a[ * i][ * j] = ;
                 a[ * i][ * j + ] = ;
                 a[ * i][ * j + ] = ;
                 a[ * i + ][ * j] = ;
                 a[ * i + ][ * j + ] = ;
                 a[ * i + ][ * j + ] = ;
                 a[ * i + ][ * j] = ;
                 a[ * i + ][ * j + ] = ;
                 a[ * i + ][ * j + ] = ;
             }
         }
         getchar();
     }

     for (int i = ; i <  * n; i++)
     {
         for (int j = ; j <  * m; j++)
         {
             if (!a[i][j] && !vis[i][j])
             {
                 dfs(i, j);
                 cnt++;
             }
         }
     }
     cout << cnt << endl;
     return ;
 }